On distance magic Harary graphs

MaRDI QIDQ4989602zbMATH OpenFDO

Authors Appattu Vallapil Prajeesh, Krishnan Paramasivam, Km. Kathiresan

Publication date 25 May 2021

Full work available at URL https://arxiv.org/abs/1809.07382

zbMATH Keywords

refinementHarary graphproduct graphs\((a,d)\)-distance antimagicdistance magic

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: 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 distance magicness of legicographic product and direct product of G with C4, for every non-regular distance magic graph G with maximum degree |V(G)|-1.

Recommendations

• Constructing distance magic graphs from regular graphs
• Note on distance magic products G C₄
• Distance magic Cartesian products of graphs
• A note on distance magic and distance antimagic graphs
• On distance magic labeling of graphs

Cited in

(1)

• Distance magic labelling of Mycielskian graphs

This page was built for publication: On distance magic Harary graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989602)