Computing Bounds for Second Zagreb Coindex of Sum Graphs

Muhammad Javaid, Muhammad Ibraheem, Uzma Ahmad and Q. Zhu

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

Abstract:

Topological indices or coindices are one of the graph-theoretic tools which are widely used to study the different structural and chemical properties of the under study networks or graphs in the subject of computer science and chemistry, respectively. For these investigations, the operations of graphs always played an important role for the study of the complex networks under the various topological indices or coindices. In this paper, we determine bounds for the second Zagreb coindex of a well-known family of graphs called - sum ( - sum, - sum, - sum, and - sum) graphs in the form of Zagreb indices and coindices of their factor graphs, where these graphs are obtained by using four subdivision-related operations and Cartesian product of graphs. At the end, we illustrate the obtained results by providing the exact and bonded values of some specific - sum graphs.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/4671105.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/4671105.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:4671105

DOI: 10.1155/2021/4671105

Access Statistics for this article

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