Computing Exact Values for Gutman Indices of Sum Graphs under Cartesian Product

Gutman index of a connected graph is a degree-distance-based topological index. In extremal theory of graphs, there is great interest in computing such indices because of their importance in correlating the properties of several chemical compounds. In this paper, we compute the exact formulae of the...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical problems in engineering 2021, Vol.2021, p.1-20
Main Authors: Alanazi, Abdulaziz Mohammed, Farid, Faiz, Javaid, Muhammad, Munagi, Augustine
Format: Article
Language:English
Subjects:
Cartesian coordinates
Chemical compounds
Computation
Graph theory
Graphs
Mathematical problems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Gutman index of a connected graph is a degree-distance-based topological index. In extremal theory of graphs, there is great interest in computing such indices because of their importance in correlating the properties of several chemical compounds. In this paper, we compute the exact formulae of the Gutman indices for the four sum graphs (S-sum, R-sum, Q-sum, and T-sum) in the terms of various indices of their factor graphs, where sum graphs are obtained under the subdivision operations and Cartesian products of graphs. We also provide specific examples of our results and draw a comparison with previously known bounds for the four sum graphs.
ISSN:1024-123X
1563-5147
DOI:10.1155/2021/5569997