2018/08/02 by A. V. Prajeesh, Krishnan Paramasivam, Prajeesh, A V +1
Computer Science · Engineering · #05c78 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1808.00951
openalex publication_date 2018/08/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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- partite graph and disjoint union of m copies of lexicographic product of cycle with complement of complete graph. In addition to that, we also prove some necessary conditions for a regular graph to be of distance magic index one.