K. Premalatha
K. Premalatha 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
4 shared publications - Wai Chee Shiu
Department of Mathematics, The Chinese University of Hong Kong, Shatin, Hong Kong, China
4 shared publications - M. Nalliah
Vellore Institute of Technology, Vellore
2 shared publications - M. Nalliah
Department of Mathematics School of Advanced Sciences Vellore Institute of Technology 632014 Vellore Tamil Nadu India
2 shared publications - Subramanian Arumugam
Ramco Institute of Technology
2 shared publications - Andrea Semaničová-Feňovčíková
Department of Applied Mathematics and Informatics, Technical University, 042 00 Košice, Slovakia
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
Construction of local antimagic 3-colorable graphs of fixed even size -- matrix approach
An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f: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 $χ_{la}(G)$, is the minimum number of distinct induced vertex labels over all local antimagic labelings of $G$. Suppose $χ_{la}(G)=χ_{la}(H)$ and $G_H$ is obtained from $G$ and $H$ by merging some vertices of $G$ with some vertices of $H$ bijectively. In this paper, we give ways to construct matrices with integers in $[1,10k]$, $k\ge 1$, that meet certain properties. Consequently, we obtained many families of (disconnected) bipartite (and tripartite) graphs of size $10k$ with local antimagic chromatic number 3.Open AccessConstruction of local antimagic 3-colorable graphs of fixed even size -- matrix approach
An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f: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 $χ_{la}(G)$, is the minimum number of distinct induced vertex labels over all local antimagic labelings of $G$. Suppose $χ_{la}(G)=χ_{la}(H)$ and $G_H$ is obtained from $G$ and $H$ by merging some vertices of $G$ with some vertices of $H$ bijectively. In this paper, we give ways to construct matrices with integers in $[1,10k]$, $k\ge 1$, that meet certain properties. Consequently, we obtained many families of (disconnected) bipartite (and tripartite) graphs of size $10k$ with local antimagic chromatic number 3. - Open Access
Constructions of local antimagic 3-colorable graphs of fixed odd size | matrix approach
An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if there is a bijection $f: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 $χ_{la}(G)$, is the minimum number of distinct induced vertex labels over all local antimagic labelings of $G$. In this paper, we give three ways to construct a $(3m+2)\times (2k+1)$ matrix that meets certain properties for $m=1,3$ and $k\ge 1$. Consequently, we obtained many (disconnected) graphs of size $(3m+2)(2k+1)$ with local antimagic chromatic number 3.Open AccessConstructions of local antimagic 3-colorable graphs of fixed odd size | matrix approach
An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if there is a bijection $f: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 $χ_{la}(G)$, is the minimum number of distinct induced vertex labels over all local antimagic labelings of $G$. In this paper, we give three ways to construct a $(3m+2)\times (2k+1)$ matrix that meets certain properties for $m=1,3$ and $k\ge 1$. Consequently, we obtained many (disconnected) graphs of size $(3m+2)(2k+1)$ with local antimagic chromatic number 3. - 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.
- 23 July 2020
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 25 (6) , 1591-1602
Local antimagic chromatic number of trees - I
Let G = (V, E) be a connected graph with |V|= n and |E|= m. A bijection f : E → {1, 2, … , m} is called a local antimagic lableing if for any two adjacent vertices u and v, w(u) ≠ w(v), where w(u)= ∑ e ϵE(u) f (e) and E(u) is the set of edges incident to u. Thus any local antimagic labeling induces a proper vertex coloring of G where the vertex v is assigned the color w(v). The local antimagic chromatic number χla (G) is the minimum number of colors taken over all colorings induced by local antimagic labelings of G. In this paper we determine the local antimagic chromatic number of several families of trees.
- 23 July 2020
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 25 (6) , 1591-1602
Local antimagic chromatic number of trees - I
Let G = (V, E) be a connected graph with |V|= n and |E|= m. A bijection f : E → {1, 2, … , m} is called a local antimagic lableing if for any two adjacent vertices u and v, w(u) ≠ w(v), where w(u)= ∑ e ϵE(u) f (e) and E(u) is the set of edges incident to u. Thus any local antimagic labeling induces a proper vertex coloring of G where the vertex v is assigned the color w(v). The local antimagic chromatic number χla (G) is the minimum number of colors taken over all colorings induced by local antimagic labelings of G. In this paper we determine the local antimagic chromatic number of several families of trees.
- Top Cited Papers
- 7 January 2017
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 33 (2) , 275-285
Local Antimagic Vertex Coloring of a Graph
- 7 January 2017
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 33 (2) , 275-285
Top Cited PapersLocal Antimagic Vertex Coloring of a Graph