Self-Centeredness of Derived Graphs Using D-Distance
M.V. Ramanjaneyulu1, Varma P. L. N2, D. Reddy Babu3

1M.V. Ramanjaneyulu, KKR & KSR Institute of Technology and Sciences, Vinjanampadu, Guntur (Andhra Pradesh), India.
2Varma P. L. N, Division, Department of Mathematics, Science & Humanities, V.F.S.T.R., Vadlamudi, Guntur (Andhra Pradesh), India.
3D. Reddy Babu, Department of Mathematics, GST, GITAM University, Doddaballapur, Bengaluru (Karnataka), India.
Manuscript received on 13 February 2019 | Revised Manuscript received on 04 March 2019 | Manuscript Published on 08 June 2019 | PP: 251-256 | Volume-7 Issue-5S4, February 2019 | Retrieval Number: E10500275S419/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: In communication networks, the number of switches on the short- est path between input and output that are farthest apart is the diameter of network. Thus an approximate measure of worst case latency is given by diameter. We study graphs for which the radius and diameter are equal using D-distance in this article. We study the D-self-centeredness of a graph and its derived graphs, namely, line graph, middle graph and total graph using D-distance. We end the article with some open problems.
Keywords: Graphs Self Centeredness Derived Network.
Scope of the Article: Cryptography and Applied Mathematics