M. Nalliah
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
M. Nalliah has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Gee-Choon Lau
77D, Jalan Suboh, 85000 Johor, Malaysia
3 shared publications - Wai Chee Shiu
Department of Mathematics, The Chinese University of Hong Kong, Shatin, Hong Kong, China
3 shared publications - K. Premalatha
Department of Mathematics Sri Shakthi Institute of Engineering and Technology 641062 Coimbatore Tamil Nadu India
2 shared publications - V. Priyadharshini
Department of Mathematics, School of Advanced sciences, Vellore Institute of Technology, Vellore, India
2 shared publications - R. Shankar
Department of Mathematics School of Arts and Science Vinayaka Mission's Chennai Campus Vinayaka Mission's Research Foundation (Deemed to be University) Paiyanoor-603 104 Tamil Nadu India
1 shared publication - Ruixue Zhang
School of Mathematics and Statistics Qingdao University China
1 shared publication
Latest Publications
- 25 September 2024
- Published by Udmurt State University in Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki
- Vol. 34 (3) , 375-396
Complete characterization of bridge graphs with local antimagic chromatic number 2
An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f\colon E \to\{1,\ldots ,|E|\}$ such that for any pair of adjacent vertices $x$ and $y$, $f^+(x)\not= f^+(y)$, where the induced vertex label $f^+(x)= \sum f(e)$, with $e$ ranging over all the edges incident to $x$. The local antimagic chromatic number of $G$, denoted by $\chi_{la}(G)$, is the minimum number of distinct induced vertex labels over all local antimagic labelings of $G$. In this paper, we characterize $s$-bridge graphs with local antimagic chromatic number 2.- 25 September 2024
- Published by Udmurt State University in Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki
- Vol. 34 (3) , 375-396
Complete characterization of bridge graphs with local antimagic chromatic number 2
An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f\colon E \to\{1,\ldots ,|E|\}$ such that for any pair of adjacent vertices $x$ and $y$, $f^+(x)\not= f^+(y)$, where the induced vertex label $f^+(x)= \sum f(e)$, with $e$ ranging over all the edges incident to $x$. The local antimagic chromatic number of $G$, denoted by $\chi_{la}(G)$, is the minimum number of distinct induced vertex labels over all local antimagic labelings of $G$. In this paper, we characterize $s$-bridge graphs with local antimagic chromatic number 2.- Open Access
- 15 April 2024
- Published by Hacettepe University in Hacettepe Journal of Mathematics and Statistics
- Vol. 53 (3) , 1-15
Local Distance Antimagic Chromatic Number of Join Product of Graphs with Cycles or Paths
Let G be a graph of order p without isolated vertices. A bijection f : V → {1, 2, 3, . . . , p} is called a local distance antimagic labeling, if wf (u) ̸= wf (v) for every edge uv of G, where wf(u) =ΣxϵN(u) f(x). The local distance antimagic chromatic number χlda(G) is defined to be the minimum number of colors taken over all colorings of G induced by local distance antimagic labelings of G. In this paper, we determined the local distance antimagic chromatic number of some cycles, paths, disjoint union of 3-paths. We also determined the local distance antimagic chromatic number of join products of some graphs with cycles or paths.
- 15 April 2024
- Published by Hacettepe University in Hacettepe Journal of Mathematics and Statistics
- Vol. 53 (3) , 1-15
Open AccessLocal Distance Antimagic Chromatic Number of Join Product of Graphs with Cycles or Paths
Let G be a graph of order p without isolated vertices. A bijection f : V → {1, 2, 3, . . . , p} is called a local distance antimagic labeling, if wf (u) ̸= wf (v) for every edge uv of G, where wf(u) =ΣxϵN(u) f(x). The local distance antimagic chromatic number χlda(G) is defined to be the minimum number of colors taken over all colorings of G induced by local distance antimagic labelings of G. In this paper, we determined the local distance antimagic chromatic number of some cycles, paths, disjoint union of 3-paths. We also determined the local distance antimagic chromatic number of join products of some graphs with cycles or paths.
- Open Access
- 3 April 2024
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 43 (2) , 473-494
On local distance antimagic chromatic number of graphs disjoint union with 1-regular graphs
Let $G$ be a graph on $p$ vertices and $q$ edges with no isolated vertices. A bijection $f: V\rightarrow \{1,2,3,...,p\}$ is called local distance antimagic labeling, if for any two adjacent vertices $u$ and $v$, we have $w(u) \neq w(v)$, where $w(u)=\sum_{x\epsilon N(u)} {f(x)}$. The local distance antimagic chromatic number $\chi_{lda}(G)$ is defined to be the minimum number of colors taken over all colorings of $G$ induced by local distance antimagic labelings of $G$. In this paper, we obtained the necessary and sufficient condition for the local distance antimagic chromatic number of some disjoint union of graphs with 1-regular graphs equal to the number of distinct neighbors of its pendant vertices. We also gave a correct result in [Local Distance Antimagic Vertex Coloring of Graphs, https://arxiv.org/abs/2106.01833v1(2021)].%magic Vertex Coloring of Graphs, https://arxiv.org/abs/2106.01833v1- 3 April 2024
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 43 (2) , 473-494
Open AccessOn local distance antimagic chromatic number of graphs disjoint union with 1-regular graphs
Let $G$ be a graph on $p$ vertices and $q$ edges with no isolated vertices. A bijection $f: V\rightarrow \{1,2,3,...,p\}$ is called local distance antimagic labeling, if for any two adjacent vertices $u$ and $v$, we have $w(u) \neq w(v)$, where $w(u)=\sum_{x\epsilon N(u)} {f(x)}$. The local distance antimagic chromatic number $\chi_{lda}(G)$ is defined to be the minimum number of colors taken over all colorings of $G$ induced by local distance antimagic labelings of $G$. In this paper, we obtained the necessary and sufficient condition for the local distance antimagic chromatic number of some disjoint union of graphs with 1-regular graphs equal to the number of distinct neighbors of its pendant vertices. We also gave a correct result in [Local Distance Antimagic Vertex Coloring of Graphs, https://arxiv.org/abs/2106.01833v1(2021)].%magic Vertex Coloring of Graphs, https://arxiv.org/abs/2106.01833v1 - 31 October 2023
- Published by Springer Nature in Ukrainian Mathematical Journal
- Vol. 75 (5) , 765-781
Local Distance Antimagic Chromatic Number for the Union of Star and Double Star Graphs
- 31 October 2023
- Published by Springer Nature in Ukrainian Mathematical Journal
- Vol. 75 (5) , 765-781
Local Distance Antimagic Chromatic Number for the Union of Star and Double Star Graphs
- Open Access
- 13 September 2023
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 42 (5) , 1307-1332
On local antimagic chromatic numbers of circulant graphs join with null graphs or cycles
An edge labeling of a graph G = (V,E) is said to be local antimagic if there is a bijection f : E → {1,..., |E|} such that for any pair of adjacent vertices x and y, f +(x) ≠ f +(y), where the induced vertex label is f +(x) = ? f(e), with e ranging over all the edges incident to x. The local antimagic chromatic number of G, denoted by χla(G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. For a bipartite circulant graph G, it is known that χ(G)=2 but χla(G) ≥ 3. Moreover, χla(Cn ∨ K1)=3 (respectively 4) if n is even (respectively odd). Let G be a graph of order m ≥ 3. In [Affirmative solutions on local antimagic chromatic number, Graphs Combin., 36 (2020), 1337—1354], the authors proved that if m ≡ n (mod 2) with χla(G) = χ(G), m>n ≥ 4 and m ≥ n2/2, then χla(G∨On) = χla(G)+1. In this paper, we show that the conditions can be omitted in obtaining χla(G∨H) for some circulant graph G, and H is a null graph or a cycle. The local antimagic chromatic number of certain wheel related graphs are also obtained.
- 13 September 2023
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 42 (5) , 1307-1332
Open AccessOn local antimagic chromatic numbers of circulant graphs join with null graphs or cycles
An edge labeling of a graph G = (V,E) is said to be local antimagic if there is a bijection f : E → {1,..., |E|} such that for any pair of adjacent vertices x and y, f +(x) ≠ f +(y), where the induced vertex label is f +(x) = ? f(e), with e ranging over all the edges incident to x. The local antimagic chromatic number of G, denoted by χla(G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. For a bipartite circulant graph G, it is known that χ(G)=2 but χla(G) ≥ 3. Moreover, χla(Cn ∨ K1)=3 (respectively 4) if n is even (respectively odd). Let G be a graph of order m ≥ 3. In [Affirmative solutions on local antimagic chromatic number, Graphs Combin., 36 (2020), 1337—1354], the authors proved that if m ≡ n (mod 2) with χla(G) = χ(G), m>n ≥ 4 and m ≥ n2/2, then χla(G∨On) = χla(G)+1. In this paper, we show that the conditions can be omitted in obtaining χla(G∨H) for some circulant graph G, and H is a null graph or a cycle. The local antimagic chromatic number of certain wheel related graphs are also obtained.
- Open Access
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2852 (1)
Zero divisor index of small order graphs
Let G = (V, E) be an arbitrary graph with vertex set V = V (G), edge set E = E(G) and ℝ be any nonzero commutative ring with 1 ≠ 0. Let Z(ℝ) denote the set of all zero-divisors of ℝ then, an injective function f : V→Z(ℝ)∗ is called zero-divisor labeling of G if for every edge e = uv ∈ E, f (u) f (v)= 0, where ’0’ is the additive identity of ℝ. A zero-divisor index of G is the least positive integer k such that there is a zero-divisor labeling f : V→Z(ℝ)∗ of G with |Z(ℝ)∗| = k, denoted by Θ’(G). A zero-divisor labeling f : V→Z(ℝ)∗ of G is optimal if |Z(ℝ)∗| = Θ’(G). In this paper, we determine a zero-divisor index of a graph with order n, where 1 ≤ n ≤ 15.
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2852 (1)
Open AccessZero divisor index of small order graphs
Let G = (V, E) be an arbitrary graph with vertex set V = V (G), edge set E = E(G) and ℝ be any nonzero commutative ring with 1 ≠ 0. Let Z(ℝ) denote the set of all zero-divisors of ℝ then, an injective function f : V→Z(ℝ)∗ is called zero-divisor labeling of G if for every edge e = uv ∈ E, f (u) f (v)= 0, where ’0’ is the additive identity of ℝ. A zero-divisor index of G is the least positive integer k such that there is a zero-divisor labeling f : V→Z(ℝ)∗ of G with |Z(ℝ)∗| = k, denoted by Θ’(G). A zero-divisor labeling f : V→Z(ℝ)∗ of G is optimal if |Z(ℝ)∗| = Θ’(G). In this paper, we determine a zero-divisor index of a graph with order n, where 1 ≤ n ≤ 15.
- Open Access
- 7 November 2022
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 41 (6) , 1397-1412
On local edge antimagic chromatic number of graphs
Let G=(V,E) be a graph of order p and size q having no isolated vertices. A bijection f from V to {1,2,3,...,p} is called a local edge antimagic labeling if for any two adjacent edges e=uv and e'=vw of G, we have w(e) is not equal to w (e'), where the edge weight w(e=uv)=f(u)+f(v) and w(e')=f(v)+f(w). A graph G is local edge antimagic if G has a local edge antimagic labeling. The local edge antimagic chromatic number is defined to be the minimum number of colors taken over all colorings of G induced by local edge antimagic labelings of G. In this paper, we determine the local edge antimagic chromatic number for a friendship graph, wheel graph, fan graph, helm graph, flower graph, and closed helm.
- 7 November 2022
- Published by Universidad Catolica del Norte - Chile in Proyecciones (Antofagasta)
- Vol. 41 (6) , 1397-1412
Open AccessOn local edge antimagic chromatic number of graphs
Let G=(V,E) be a graph of order p and size q having no isolated vertices. A bijection f from V to {1,2,3,...,p} is called a local edge antimagic labeling if for any two adjacent edges e=uv and e'=vw of G, we have w(e) is not equal to w (e'), where the edge weight w(e=uv)=f(u)+f(v) and w(e')=f(v)+f(w). A graph G is local edge antimagic if G has a local edge antimagic labeling. The local edge antimagic chromatic number is defined to be the minimum number of colors taken over all colorings of G induced by local edge antimagic labelings of G. In this paper, we determine the local edge antimagic chromatic number for a friendship graph, wheel graph, fan graph, helm graph, flower graph, and closed helm.
- Open Access
- 21 August 2022
- Published by Tamkang Journal of Mathematics in Tamkang Journal of Mathematics
- Vol. 54 (4) , 281-291
Local distance antimagic chromatic number for the union of complete bipartite graphs
Let G be a graph on p vertices and q edges with no isolated vertices. A bijection f : V → {1, 2, 3, ..., p} is called local distance antimagic labeling, if for any two adjacent vertices u and v, we have w(u) is not equal to w(v), where w(u) is the sum of all neighbour labels of u. The local distance antimagic chromatic number χlda(G) is defined to be the minimum number of colors taken overall colorings of G induced by local distance antimagic labelings of G. In this paper, we determine the graph G for the local distance antimagic chromatic number is 2.
- 21 August 2022
- Published by Tamkang Journal of Mathematics in Tamkang Journal of Mathematics
- Vol. 54 (4) , 281-291
Open AccessLocal distance antimagic chromatic number for the union of complete bipartite graphs
Let G be a graph on p vertices and q edges with no isolated vertices. A bijection f : V → {1, 2, 3, ..., p} is called local distance antimagic labeling, if for any two adjacent vertices u and v, we have w(u) is not equal to w(v), where w(u) is the sum of all neighbour labels of u. The local distance antimagic chromatic number χlda(G) is defined to be the minimum number of colors taken overall colorings of G induced by local distance antimagic labelings of G. In this paper, we determine the graph G for the local distance antimagic chromatic number is 2.
- 29 March 2022
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 26 (4) , 1-16
Local antimagic vertex coloring for generalized friendship graphs
Let G = (V, E) be a graph of order p and size q without isolated vertices. A bijection f: E → {1, 2, … , q} is called a local antimagic labeling if w(u) ≠ w(v) for all uv ∈ E, where the vertex weight w(u) = Ʃe∈E(u) f(e) and E(u) is the set of edges incident to the vertex u ∈ V. The local antimagic chromatic number χla(G) is defined to be the minimum number of colors(vertex weights) taken over all colorings of G induced by local antimagic labelings of G. In this paper, we study the local chromatic number for generalized friendship graph of complete graphs and cycles.
- 29 March 2022
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 26 (4) , 1-16
Local antimagic vertex coloring for generalized friendship graphs
Let G = (V, E) be a graph of order p and size q without isolated vertices. A bijection f: E → {1, 2, … , q} is called a local antimagic labeling if w(u) ≠ w(v) for all uv ∈ E, where the vertex weight w(u) = Ʃe∈E(u) f(e) and E(u) is the set of edges incident to the vertex u ∈ V. The local antimagic chromatic number χla(G) is defined to be the minimum number of colors(vertex weights) taken over all colorings of G induced by local antimagic labelings of G. In this paper, we study the local chromatic number for generalized friendship graph of complete graphs and cycles.
- 1 July 2015
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 48, 103-110
Super (a, d)-edge antimagic total labelings of friendship and generalized friendship graphs
- 1 July 2015
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 48, 103-110
Super (a, d)-edge antimagic total labelings of friendship and generalized friendship graphs