A V Prajeesh
@nitc.ac.in
Senior Research Fellow
National Institute of Technology Calicut
EDUCATION
in Mathematics and Scientific computing
RESEARCH INTERESTS
Algebraic Graph Theory, Graph labeling, Combinatorics
Scopus Publications
Scholar Citations
Scholar h-index
Scopus Publications
Sarath V S and A V Prajeesh
IEEE
Let G = (V, E) be a connected graph with |V| = <tex>$n$</tex> and | E| = m. A bijection <tex>$f$</tex> from <tex>$E$</tex> to the set of integers <tex>$\\{1, 2,\\ldots,\\ m\\}$</tex> is called a local antimagic labeling of <tex>$G$</tex> if for any two adjacent vertices <tex>$u$</tex> and <tex>$v$</tex> in G, w(u) is not equal to w(v), where <tex>$w$</tex>(u) is the sum of the labels of all the edges incident to u. Thus any local antimagic labeling induces a proper vertex coloring of <tex>$G$</tex> where the vertex <tex>$v$</tex> is assigned the color <tex>$w$</tex>(<tex>$v$</tex>). Also, the local antimagic chromatic number is defined to be the minimum number of colors taken over all colorings induced by local antimagic labelings of G. In this paper, the local antimagic chromatic number of diameter 3 trees, certain classes of diameter 4 trees and complete bipartite graph K<inf>m,n</inf> where <tex>$m$</tex> and <tex>$n$</tex> are of different parity are obtained.
D. Froncek, K. Paramasivam, and A. V. Prajeesh
Wiley
A. V. Prajeesh, K. Muhammed Sabeel, and K. Paramasivam
AIP Publishing
T. Sreehari, A. V. Prajeesh, Janitha Kolayil, and K. Paramasivam
AIP Publishing
A. V. Prajeesh and K. Paramasivam
In this paper, we provide few results on the group distance magic labeling of lexicographic product and direct product of two graphs. We also prove some necessary conditions for a graph to be group distance magic and provide a characterization for a tree to be group distance magic.
Muhammed Sabeel Kollaran, Appattu Vallapil Prajeesh, and Krishnan Paramasivam
Springer Singapore
N. Kamatchi, K. Paramasivam, A.V. Prajeesh, K. Muhammed Sabeel, and S. Arumugam
Informa UK Limited
Abstract Let G = ( V ( G ) , E ( G ) ) be a simple undirected graph and let A be an additive abelian group with identity 0. A mapping l : V ( G ) → A ∖ { 0 } is said to be a A -vertex magic labeling of G if there exists an element μ of A such that w ( v ) = ∑ u ∈ N ( v ) l ( u ) = μ for any vertex v of G , where N ( v ) is the open neighborhood of v . A graph G that admits such a labeling is called an A -vertex magic graph. If G is A -vertex magic graph for any nontrivial abelian group A , then G is called a group vertex magic graph. In this paper, we obtain a few necessary conditions for a graph to be group vertex magic. Further, when A ≅ Z 2 ⊕ Z 2 , we give a characterization of trees with diameter at most 4 which are A -vertex magic.
Appattu Vallapil Prajeesh, Krishnan Paramasivam, and Nainarraj Kamatchi
Springer International Publishing
An equalized incomplete tournament EIT(p, r) on p teams which are ranked from 1 to p, is a tournament in which every team plays against r teams and the total strength of the opponents that every team plays with is a constant. A handicap incomplete tournament HIT(p, r) on p teams is a tournament in which every team plays against r opponents in such a way that