Abstrait
A Note on Radius and Diameter of A Graph w.r.t. D-Distance
D. Reddy Baby and P. L. N. Varma
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. In this article, we study the relations between radius and diameter of a graph with respect to D-distance, and also we obtain some results on trees with respect to D-distance.
Avertissement: testCe résumé a été traduit à l'aide d'outils d'intelligence artificielle et n'a pas encore été examiné ni vérifié
