Edge-to-vertex and edge-to-edge D-distances
Keywords:
D-distance, radius, diameter, center, eccentricityAbstract
In a (simple and connected) graph G, the concept of distance is one of the important concept. Earlier we introduced the concept of D-distance between vertices of a graph.
In this article we study edge-to-vertex and edge-to-edge distances w.r.t. D-distance. We obtain relation between their eccentrics and also determine centers of some graphs. We prove the relation between the edge-to-vertex and edge-to-edge D-eccentricities w.r.t. D-distance. We also prove that for any graph G either \(C_{2}^{D}(G)\) ⊆ \(C_{3}^{D}(G)\) or \(C_{3}^{D}(G)\) ⊆\(C_{2}^{D}(G)\).
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 Varma P.L.N., Reddy Babu, T. Nageswara Rao

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)

