Nima Ghanbari
Department of Mathematics, Yazd University, 89195-741, Yazd, Iran.

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Computation of Gutman index of some cactus chains Ali Sadeghieh; Nima Ghanbari; Saeid Alikhani
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 6, No 1 (2018): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2018.6.1.10

Abstract

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 ∈ 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.