Krishan Paramasivam
@nitc.ac.in
Associate Professor, Department of Mathematics
National Institute of Technology Calicut, Kozhikode
I am an Associate Professor of Department of Mathematics, National Institute of Technology Calicut.
EDUCATION
Ph.D. Indian Institute of Technology Calicut
RESEARCH INTERESTS
Graph theory, Commutative algebra
Scopus Publications
Scholar Citations
Scholar h-index
Scopus Publications
D. Froncek, K. Paramasivam, and A. V. Prajeesh
Wiley
Krishnan Paramasivam and K. Muhammed Sabeel
World Scientific Pub Co Pte Ltd
Let [Formula: see text], [Formula: see text], [Formula: see text] denote the zero-divisor graph, compressed zero-divisor graph and annihilating ideal graph of a commutative ring [Formula: see text], respectively. In this paper, we prove that [Formula: see text] for a semisimple commutative ring [Formula: see text] and represent [Formula: see text] as a generalized join of a finite set of graphs. Further, we study the zero-divisor graph of a semisimple group-ring [Formula: see text] and proved several structural properties of [Formula: see text] and [Formula: see text], where [Formula: see text] is a field with [Formula: see text] elements and [Formula: see text] is a cyclic group with [Formula: see text] elements.
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