共 50 条
Computing Bounds for Second Zagreb Coindex of Sum Graphs
被引:0
|作者:
Javaid, Muhammad
[1
]
Ibraheem, Muhammad
[1
]
Ahmad, Uzma
[2
]
Zhu, Q.
[3
,4
]
机构:
[1] Department of Mathematics, School of Science, University of Management and Technology, Lahore,54770, Pakistan
[2] Department of Mathematics, University of the Punjab, Lahore, Pakistan
[3] School of Mathematics and Statistics, Hunan Normal University, Hunan, Changsha,4100081, China
[4] Department of Mathematics, School of Information Science and Engineering, Chengdu University, Chengdu,610106, China
关键词:
Graphic methods - Graph theory;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
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 F-sum (S-sum, R-sum, Q-sum, and T-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 F-sum graphs. © 2021 Muhammad Javaid et al.
引用
收藏
相关论文