Abstrait

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.


Indexé dans

  • CASS
  • Google Scholar
  • Ouvrir la porte J
  • Infrastructure nationale du savoir de Chine (CNKI)
  • CiterFactor
  • Cosmos SI
  • Bibliothèque de revues électroniques
  • Répertoire d’indexation des revues de recherche (DRJI)
  • Laboratoires secrets des moteurs de recherche
  • ICMJE

Voir plus

Flyer