抽象的

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.


索引于

  • 中国社会科学院
  • 谷歌学术
  • 打开 J 门
  • 中国知网(CNKI)
  • 引用因子
  • 宇宙IF
  • 电子期刊图书馆
  • 研究期刊索引目录 (DRJI)
  • 秘密搜索引擎实验室
  • ICMJE

查看更多

期刊国际标准号

期刊 h 指数

Flyer