SOME RESULTS ON DISTANCED-BALANCED AND STRONGLY DISTANCE-BALANCED GRAPHS
Keywords:
distance-balanced graph, strongly distance-balanced graph, graph invariant, graph operationAbstract
Distance-balanced graphs are graphs in which for every edge e = uv the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. The graph is strongly distance-balanced if the relation holds for every distance of i which 0 ≤ i ≤ diam(G). In this paper, we study some local properties of them and also under some graph operations.
Downloads
Published
2018-07-31
How to Cite
Faramarzi, H., Rahbarnia, F., & Tavakoli, M. (2018). SOME RESULTS ON DISTANCED-BALANCED AND STRONGLY DISTANCE-BALANCED GRAPHS. Italian Journal of Pure and Applied Mathematics, 40, 98–107. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/7051
Issue
Section
Articoli - Forum Editrice
License
Copyright (c) 2018 H. Faramarzi, F. Rahbarnia, M. Tavakoli
This work is licensed under a Creative Commons Attribution 4.0 International License.
L'opera è pubblicata sotto Licenza Creative Commons Attribuzione 4.0 Internazionale (CC-BY)
