Gutman Index and Detour Gutman Index of Pseudo‐Regular Graphs

S. Kavithaa and V. Kaladevi

Journal of Applied Mathematics, 2017, vol. 2017, issue 1

Abstract: 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 Gut(G) = ∑u≠vd(u)d(v)D(u, v), where D(u, v) is the longest distance between vertices u and v. In this paper, the Gutman index and the Detour Gutman index of pseudo‐regular graphs are determined.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2017/4180650

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2017:y:2017:i:1:n:4180650

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().