THE DISTANCE MAGIC INDEX OF A GRAPH
| dc.contributor.author | Godinho, Aloysius | |
| dc.date.accessioned | 2025-04-03T04:55:51Z | |
| dc.date.available | 2025-04-03T04:55:51Z | |
| dc.date.issued | 2018 | |
| dc.description.abstract | Let G be a graph of order n and let S be a set of positive integers with |S| = n. Then G is said to be S-magic if there exists a bijection φ : V (G) → S satisfying P x∈N(u) φ(x) = k (a constant) for every u ∈ V (G). Let α(S) = max{s : s ∈ S}. Let i(G) = min α(S), where the minimum is taken over all sets S for which the graph G admits an S-magic labeling. Then i(G) − n is called the distance magic index of the graph G. In this paper we determine the distance magic index of trees and complete bipartite graphs | |
| dc.identifier.uri | http://rcca.ndl.gov.in/handle/123456789/117 | |
| dc.title | THE DISTANCE MAGIC INDEX OF A GRAPH |