The smallest hosoya index in \((n,n+1)\)-graphs
From MaRDI portal
Publication:926920
DOI10.1007/s10910-006-9186-6zbMath1143.05063OpenAlexW2052629760MaRDI QIDQ926920
Publication date: 21 May 2008
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-006-9186-6
Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items
The minimum matching energy of bicyclic graphs with given girth ⋮ The smallest Merrifield-Simmons index of \((n,n+1)\)-graphs ⋮ On the permanental sum of bicyclic graphs ⋮ Maxima and minima of the Hosoya index and the Merrifield-Simmons index ⋮ The Hosoya index and the Merrifield-Simmons index ⋮ The extremal values of some topological indices in bipartite graphs with a given matching number ⋮ On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number ⋮ Graphs with maximal Hosoya index and minimal Merrifield-Simmons index ⋮ Orderings of a class of trees with respect to the Merrifield-Simmons index and the Hosoya index
Cites Work
- Unnamed Item
- Unnamed Item
- On the ordering of graphs with respect to their matching numbers
- On acyclic conjugated molecules with minimal energies
- On minimal energy ordering of acyclic conjugated molecules
- On acyclic systems with minimal Hosoya index
- A note on the number of matchings and independent sets in trees