1 citations · 1 across the 7 of their papers we have counts for
7 papers
Enumerating the distance magic labelings of a distance magic graph
A V Prajeesh, Krishnan Paramasivam
Let be a graph of order . A bijection is a distance magic labeling of if there exists a positive integer such that $\sum…
On determining number and metric dimension of zero-divisor graphs
Muhammed Sabeel K, Krishnan Paramasivam
In this article, explicit formulas for finding the determining number and the metric dimension of the zero-divisor graph of Z_n and non-Boolean semisimple rings are given. In the c…
Group vertex magicness of product graphs and trees
Karthik S, M Sabeel K, K. Paramasivam
In this article, some necessary conditions of group vertex magicness of graphs with at least one pendant, group vertex magicness of product graphs, are proved. A characterization o…
A note on distance magic index of partite graphs
Eshwar Srinivasan, A V Prajeesh, Krishnan Paramasivam
In this article, the distance magic index of certain important classes of partite graphs are determined.
On Distance Magic Harary Graphs
A V Prajeesh, Krishnan Paramasivam
This paper establishes two techniques to construct larger distance magic and (a, d)-distance antimagic graphs using Harary graphs and provides a solution to the existence of distan…
Notes On Group Distance Magicness of Product Graphs
A V Prajeesh, Krishnan 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…
Distance Magic Index One Graphs
A V Prajeesh, Krishnan Paramasivam
In this paper, we determine the distance magic index of lexicograph product of a regular graph with the complement of complete graph, disjoint union of m copies of complete multi-…