On nearly distance magic graphs
| dc.contributor.author | Godinho, Aloysius | |
| dc.date.accessioned | 2025-05-28T06:35:57Z | |
| dc.date.available | 2025-05-28T06:35:57Z | |
| dc.date.issued | 2017 | |
| dc.description.abstract | Let G = (V, E) be a graph on n vertices. A bijection f ∶ V → {1, 2, . . . , n} is called a nearly distance magic labeling of G if there exist a positive integer k such that ∑x∈N(v) f(x) = k or k +1 for every v ∈ V . The constant k is called magic constants of the graph and the graph which admits such a labeling is called a nearly distance magic graph. In this paper we present several basic results on nearly distance magic graphs and compute the magic constant k in terms of the fractional total domination number of the graph. | |
| dc.identifier.citation | Godinho, A., Singh, T., & Arumugam, S. (2017). On nearly distance magic graphs. In Theoretical Computer Science and Discrete Mathematics: First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers 1 (pp. 76-82). Springer International Publishing. | |
| dc.identifier.uri | http://rcca.ndl.gov.in/handle/123456789/227 | |
| dc.language.iso | en | |
| dc.publisher | International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016 | |
| dc.title | On nearly distance magic graphs | |
| dc.type | Article |