AVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH

Authors

  • D. Reddy Babu Koneru Lakshmaiah Education Foundation - Department of Mathematics
  • P.L.N. Varma V.F.S.T.R. University - Department of Science & Humanities

Keywords:

D-distance, average D-distance, diameter

Abstract

The D-distance between vertices of a graph G is obtained by considering the path lengths and as well as the degrees of vertices present on the path.  The average D-distance between the vertices of a connected graph is the average of the D-distances between all pairs of vertices of the graph.  In this article we study the average D-distance between the vertices of a graph.

Cover of n°33 Italian Journal of Pure and Applied Mathematics

Downloads

Published

2014-12-29

How to Cite

Babu, D. R., & Varma, P. (2014). AVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH. Italian Journal of Pure and Applied Mathematics, 33, 293–298. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/6253

Issue

N°33 - December 2014

Section

Articoli - Forum Editrice

License

Copyright (c) 2014 D. Reddy Babu, P.L.N. Varma

Creative Commons License

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)

Similar Articles

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