Abstrato

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 em

  • CASS
  • Google Scholar
  • Abra o portão J
  • Infraestrutura Nacional de Conhecimento da China (CNKI)
  • CiteFactor
  • Cosmos SE
  • Biblioteca de Periódicos Eletrônicos
  • Diretório de indexação de periódicos de pesquisa (DRJI)
  • Laboratórios secretos de mecanismos de pesquisa
  • ICMJE

Veja mais

Flyer