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

Abdulaziz Mohammed Alanazi, Faiz Farid, Muhammad Javaid and Augustine Munagi

Mathematical Problems in Engineering, 2021, vol. 2021, 1-20

Abstract:

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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/5569997.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/5569997.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5569997

DOI: 10.1155/2021/5569997

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().