Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs
The Gutman index of a connected graph G is defined as Gut(G)=∑u≠vd(u)d(v)d(u,v), where d(u) and d(v) are the degree of the vertices u and v and d(u,v) is the distance between vertices u and v. The Detour Gutman index of a connected graph G is defined as GutG=∑u≠vd(u)d(v)D(u,v), where D(u,v)...
Saved in:
Main Authors: | S. Kavithaa, V. Kaladevi |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2017-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2017/4180650 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Interview with Judith Gutman
by: Jean Kempf
Published: (2014-02-01) -
Minimum Detour Index of Tricyclic Graphs
by: Wei Fang, et al.
Published: (2019-01-01) -
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
by: Sakander Hayat, et al.
Published: (2021-01-01) -
The Connected Detour Numbers of Special Classes of Connected Graphs
by: Ahmed M. Ali, et al.
Published: (2019-01-01) -
Détours d’horizons
by: Pierre-Arnaud Chouvy
Published: (2009-03-01)