Edge-to-vertex and edge-to-edge D-distances

Authors

  • Varma P.L.N. VFSTR Vignan University - Department of Science & Humanities (Division of Mathematics)
  • Reddy Babu Tirumala Engineering College - Department of AS&H
  • T. Nageswara Rao Koneru Lakshmaiah Education Foundation - Department of Mathematics

Keywords:

D-distance, radius, diameter, center, eccentricity

Abstract

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

2020-07-31

How to Cite

P.L.N., V., Babu, R., & Rao, T. N. (2020). Edge-to-vertex and edge-to-edge D-distances. Italian Journal of Pure and Applied Mathematics, 44, 814–820. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/7417

Issue

Section

Articoli - Forum Editrice

Similar Articles

<< < 1 2 3 4 5 6 > >> 

You may also start an advanced similarity search for this article.