Computation of Gutman index of some cactus chains

Ali Sadeghieh, Nima Ghanbari, Saeid Alikhani

Abstract


Let G be a finite connected graph of order n. The Gutman index Gut(G) of G is defined as $\sum_{\{x,y\}\subseteq 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.

Keywords


Gutman index, distance, graph

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2018.6.1.10

Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats