On acrylic and unicyclic conjugated graphs with maximum Zagreb indices

zbMATH Open1264.05033MaRDI QIDQ2895372FDOQ2895372

Authors: Shuchao Li, Qin Zhao 

Publication date: 2 July 2012

Published in: Utilitas Mathematica (Search for Journal in Brave)

Recommendations

• Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
• Sharp lower bounds for the Zagreb indices of unicyclic graphs
• The second Zagreb index of acyclic conjugated molecules
• A unified approach to the extremal Zagreb indices for trees, unicyclic graphs and bicyclic graphs
• Sharp bounds for the second Zagreb index of unicyclic graphs

zbMATH Keywords

treeperfect matchingZagreb indices\(m\)-matchingunicycling graph

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (10)

• 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
• On the extremal Zagreb indices of graphs with cut edges
• On the maximum Zagreb indices of graphs with \(k\) cut vertices
• A unified approach to the extremal Zagreb indices for trees, unicyclic graphs and bicyclic graphs
• The second Zagreb index of acyclic conjugated molecules
• On acyclic molecular graphs with prescribed numbers of edges that connect vertices with given degrees
• On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
• Title not available (Why is that?)
• On the Szeged indices of [N]-cycles and monocycles containing acylic side chains

This page was built for publication: On acrylic and unicyclic conjugated graphs with maximum Zagreb indices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895372)