The Second Zagreb Indices of Graphs with Given Degree Sequences

2015/03/27 by Yuan, Wei-Gang, Xiao‐Dong Zhang, Zhang, Xiao-Dong
Chemistry · Computer Science · Mathematics · #05C07 #05C12 #Combinatorics (math.CO) #Computational Drug Discovery Methods #FOS: Mathematics #Graph theory and applications #Synthesis and Properties of Aromatic Compounds

paper · pdf · doi:10.48550/arxiv.1503.07946

openalex publication_date 2015/03/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The second Zagreb index of a graph G is denoted by M₂(G)=∑_{uv∈ E(G)}d(u)d(v). In this paper, we investigate properties of the extremal graphs with the maximum second Zagreb indices with given graphic sequences, in particular graphic bicyclic sequences. Moreover, we obtain the relations of the second Zagreb indices among the extremal graphs with different degree sequences.

Citations

• Handbook of Molecular Descriptors
• Graph theory and molecular orbitals. Total φ-electron energy of alternant hydrocarbons

Related

• Extremal graphs with maximum complementary second Zagreb index
• On reformulated zagreb indices with respect to tricyclic graphs
• Extremal Graph Theory for Degree Sequences
• The multiplicative Zagreb indices of graphs with given connectivity or number of pendant vertices
• On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree