On the extremal cacti of given parameters with respect to the difference of Zagreb indices

DOI10.1007/s10878-019-00391-4zbMath1420.05040OpenAlexW2915890124WikidataQ128341737 ScholiaQ128341737MaRDI QIDQ2424819

Shuchao Li, Licheng Zhang, Minjie Zhang

Publication date: 25 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00391-4

zbMATH Keywords

degree (of vertex)first Zagreb indexsecond Zagreb index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07)

Related Items (8)

Computation on the difference of Zagreb indices of maximal planar graphs with diameter two ⋮ Comparison between Merrifield-Simmons index and some vertex-degree-based topological indices ⋮ On sufficient conditions for Hamiltonicity of graphs, and beyond ⋮ On the sizes of generalized cactus graphs ⋮ Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices ⋮ Unnamed Item ⋮ On reduced second Zagreb index ⋮ On the extremal sombor index of trees with a given diameter

Uses Software

• AutoGraphiX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• AutoGraphiX
• Complete characterization of graphs for direct comparing Zagreb indices
• Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
• Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices
• Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
• On extremal Zagreb indices of trees with given domination number
• On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
• Sharp bounds for Zagreb indices of maximal outerplanar graphs
• On the discrepancy between two Zagreb indices
• On difference of Zagreb indices
• On the sum of squares of degrees and products of adjacent degrees
• On the extremal Zagreb indices of graphs with cut edges
• On the maximum Zagreb indices of graphs with \(k\) cut vertices
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• General multiplicative Zagreb indices of trees
• On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• The second Zagreb indices of graphs with given degree sequences
• SOME RESULTS ON THE DIFFERENCE OF THE ZAGREB INDICES OF A GRAPH

This page was built for publication: On the extremal cacti of given parameters with respect to the difference of Zagreb indices