Abstracto

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.


Indexado en

  • CAS
  • Google Académico
  • Abrir puerta J
  • Infraestructura Nacional del Conocimiento de China (CNKI)
  • Cosmos SI
  • Directorio de indexación de revistas de investigación (DRJI)
  • Laboratorios secretos de motores de búsqueda
  • ICMJE

Ver más

Flyer