Cacti with the maximum Merrifield-Simmons index and given number of cut edges

DOI10.1016/j.aml.2010.07.010zbMath1205.05117OpenAlexW2004856677MaRDI QIDQ602824

Maolin Wang

Publication date: 5 November 2010

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2010.07.010

zbMATH Keywords

extremal graphcut edgecactusMerrifield-Simmons index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
• Bipartite graphs can have any number of independent sets
• Enumeration of structure-sensitive graphical subsets: Theory
• Enumeration of structure-sensitive graphical subsets: Calculations