Some distance magic graphs
| dc.contributor.author | Godinho, Aloysius | |
| dc.date.accessioned | 2025-05-31T05:57:07Z | |
| dc.date.available | 2025-05-31T05:57:07Z | |
| dc.date.issued | 2018 | |
| dc.description.abstract | A graph G = (V, E), where |V| = n and |E| = m is said to be a distance magic graph if there exists a bijection from the vertex set V to the set {1, 2, . . . , n} such that, ā vāN(u) f (v) = k, for all u ā V, which is a constant and independent of u, where N(u) is the open neighborhood of the vertex u. The constant k is called the distance magic constant of the graph G and such a labeling f is called distance magic labeling of G. In this paper, we present new results on distance magic labeling of C r n and neighborhood expansion Dn(G) of a graph G. | |
| dc.identifier.citation | Godinho, A., & Singh, T. (2018). Some distance magic graphs. AKCE International Journal of Graphs and Combinatorics, 15(1), 1-6. | |
| dc.identifier.uri | http://rcca.ndl.gov.in/handle/123456789/240 | |
| dc.language.iso | en | |
| dc.publisher | AKCE International Journal of Graphs and Combinatorics 15 (2018) 1ā6 | |
| dc.title | Some distance magic graphs | |
| dc.type | Article |