Let G be a finite connected graph of order n. The Gutman index Gut(G) of G is defined as ∑ {x,y}⊆V (G) deg(x)deg(y)d(x, y), where deg(x) is the degree of vertex x in G and d(x, y) is the distance between vertices x and y in G. A cactus graph is a connected graph in which no edge lies in more than one cycle. In this paper we compute the exact value of Gutman index of some cactus chains.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.