The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\)

DOI10.1016/J.AML.2011.09.039zbMath1243.05125OpenAlexW2043539481MaRDI QIDQ427648

Kexiang Xu, Lingping Zhong, Jian Xi Li

Publication date: 14 June 2012

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

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

zbMATH Keywords

connectivityedge-connectivityHosoya indexMerrifield-Simmons index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (7)

On extremal bipartite graphs with a given connectivity ⋮ THE HOSOYA INDEX OF GRAPHS FORMED BY A FRACTAL GRAPH ⋮ Extremal bipartite graphs of given connectivity with respect to matching energy ⋮ On the monotonicity of topological indices and the connectivity of a graph ⋮ Enumerating independent vertex sets in grid graphs ⋮ Further results on monotonic graph invariants and bipartiteness number ⋮ The matching energy of graphs with given parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the spectral radius of graphs with connectivity at most \(k\)
• On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number
• On acyclic systems with minimal Hosoya index
• The number of independent sets in unicyclic graphs

This page was built for publication: The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\)