A. V. Prajeesh

activity

20182026

most citedOn Distance Magic Harary Graphs

1 citations · 1 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2026

Enumerating the distance magic labelings of a distance magic graph

A V Prajeesh, Krishnan Paramasivam

Let $G = (V, E)$ be a graph of order $n$ . A bijection $f : V \to {1, 2, \dots, n}$ is a distance magic labeling of $G$ if there exists a positive integer $k$ such that $\sum…

math.CO2023

Local antimagic chromatic number of partite graphs

C. R. Pavithra, A. V. Prajeesh, V. S. Sarath

Let $G$ be a connected graph with $∣ V ∣ = n$ and $∣ E ∣ = m$ . A bijection $f : E \to {1, 2, ..., m}$ is called a local antimagic labeling of $G$ if for any two adjacent vertices $…

math.CO2022

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.

math.CO2018★ 1 cited

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…

math.CO2018

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…

math.CO2018

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-…