Manuscript Title:

MEAN D-DISTANCE IN GRAPHS

Author:

D. REDDY BABU, VARMA. P. L. N, B. SRINIVASA KUMAR, D. SATISH KUMAR, M. V. RAMANJANEYULU

DOI Number:

DOI:10.17605/OSF.IO/QP84C

Published : 2023-07-23

About the author(s)

1. D. REDDY BABU - Department Of As&H, Tirumala Engineering College, Jonnalagadda, India.
2. VARMA. P. L. N - Department Of Mathematics And Statistics, School Of Applied Sciences & Humanities. F. S. T. R. (Deemed To Be University), Vadlamudi, Guntur, India.
3. B. SRINIVASA KUMAR - Department Of Engineering Mathematics, Koneru Lakahmaiah Education Foundation, Vaddeswaram, Guntur, Andhra Pradesh, India.
4. D. SATISH KUMAR - Department Of Engineering Mathematics, Koneru Lakahmaiah Education Foundation, Vaddeswaram, Guntur, Andhra Pradesh, India.
5. M. V. RAMANJANEYULU - Department of Science & Humanities, Vvit, Namburu, Guntur, India.

Full Text : PDF

Abstract

The d-distance between vertices of a graph is obtained by considering the path lengths and as well as the degrees of vertices present on the path. The mean distance between the vertices of a connected graph is the average of the distances between all pairs of vertices of the graph. In this article we study the mean d-distance between the vertices of a graph.2000 Mathematics Subject Classification. 05C12.


Keywords

D-Distance, Mean D-Distance, Diameter.