Abstracto

D-Radius and D-Diameter of Some Families of Graphs

Reddy Babu D and Varma PLN


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 D-radius and D-diameter of some families of graphs with respect to D-distance. 2000 Mathematics Subject Classification: 05C12.


Indexado en

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

Ver más

Flyer