Computation of Gutman Index of Some Cactus Chains

Ali Sadeghieh • Nima Ghanbari • Saeid Alikhani

Download full text
(English, 14 pages)

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.

Metrics

  • 121 views
  • 62 downloads

Journal

Electronic Journal of Graph Theory and Applications

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to ... see more