Computation of Gutman index of some cactus chains

Computation of Gutman index of some cactus chains

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

Full description

Saved in:
Bibliographic Details
Main Authors: Sadeghieh, Ali; Department of Mathematics, Islamic Azad University Yazd branch, Yazd, Iran (Author), Ghanbari, Nima; Department of Mathematics, Yazd University, 9195-741, Yazd, Iran. (Author), Alikhani, Saeid; Department of Mathematics, Yazd University, 9195-741, Yazd, Iran. (Author)
Other Authors: Islamic Azad University (Contributor)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2018-04-03.
Subjects:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

Get Fulltext

3rd Floor Main Library

Holdings details from 3rd Floor Main Library
Call Number: A1234.567
Copy 1 Available

Similar Items