The Multiplicative Sum Zagreb Indices of Graphs with Given Clique Number

被引：0
|
作者：
Sun, Xiaoling [1 ]
Du, Jianwei [1 ]
机构：
[1] School of Mathematics, North University of China, Shanxi, Taiyuan
来源：
Journal of Combinatorial Mathematics and Combinatorial Computing | 2024年 / 122卷
关键词：
Chromatic number; Clique number; Multiplicative sum Zagreb index;
D O I：
10.61091/jcmcc122-28
中图分类号：
学科分类号：
摘要：
The multiplicative sum Zagreb index is a modified version of the well-known Zagreb indices. The multiplicative sum Zagreb index of a graph G is the product of the sums of the degrees of pairs of adjacent vertices. The mathematical properties of the multiplicative sum Zagreb index of graphs with given graph parameters deserve further study, as they can be used to detect chemical compounds and study network structures in mathematical chemistry. Therefore, in this paper, the maximal and minimal values of the multiplicative sum Zagreb indices of graphs with a given clique number are presented. Furthermore, the corresponding extremal graphs are characterized. © 2024 the Author(s)
引用
收藏
页码：343 / 350
页数：7
相关论文
共 50 条
  • [41] Bounds on the Clique and the Independence Number for Certain Classes of Graphs
    Brimkov, Valentin E.
    Barneva, Reneta P.
    MATHEMATICS, 2024, 12 (02)
  • [42] Spectral extremal problems for graphs with bounded clique number
    Wang, Tingting
    Feng, Lihua
    Lu, Lu
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2025, 710 : 273 - 295
  • [43] New Construction of Graphs with High Chromatic Number and Small Clique Number
    Hamid Reza Daneshpajouh
    Discrete & Computational Geometry, 2018, 59 : 238 - 245
  • [44] Relationships between the clique number, chromatic number, and the degree for some graphs
    Berlov S.L.
    Automatic Control and Computer Sciences, 2010, 44 (07) : 407 - 414
  • [45] On the Sum of k Largest Laplacian Eigenvalues of a Graph and Clique Number
    Hilal A. Ganie
    S. Pirzada
    Vilmar Trevisan
    Mediterranean Journal of Mathematics, 2021, 18
  • [46] The clique number and the smallest Q-eigenvalue of graphs
    de Lima, Leonardo
    Nikiforov, Vladimir
    Oliveira, Carla
    DISCRETE MATHEMATICS, 2016, 339 (06) : 1744 - 1752
  • [47] On the clique number of Paley graphs of prime power order
    Yip, Chi Hoi
    FINITE FIELDS AND THEIR APPLICATIONS, 2022, 77
  • [48] On the Sum of k Largest Laplacian Eigenvalues of a Graph and Clique Number
    Ganie, Hilal A.
    Pirzada, S.
    Trevisan, Vilmar
    MEDITERRANEAN JOURNAL OF MATHEMATICS, 2021, 18 (01)
  • [49] Computing clique and chromatic number of circular-perfect graphs in polynomial time
    Arnaud Pêcher
    Annegret K. Wagler
    Mathematical Programming, 2013, 141 : 121 - 133
  • [50] Computing clique and chromatic number of circular-perfect graphs in polynomial time
    Pecher, Arnaud
    Wagler, Annegret K.
    MATHEMATICAL PROGRAMMING, 2013, 141 (1-2) : 121 - 133
12345