Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching
DOI10.1016/J.AML.2005.08.017zbMATH Open1119.05104OpenAlexW2055297446MaRDI QIDQ2371032FDOQ2371032
Authors: Jianping Ou
Publication date: 29 June 2007
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2005.08.017
Recommendations
- On acyclic molecular graphs with maximal Hosoya index, energy, and short diameter
- On extremal unicyclic molecular graphs with maximal Hosoya index
- The proof of a conjecture concerning acyclic molecular graphs with maximal Hosoya index and diameter 4
- The largest Hosoya index of \((n,n+1)\)-graphs
- On acyclic systems with minimal Hosoya index
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)
Cites Work
Cited In (11)
- On radius 2 trees with the maximum number of matchings
- Distance spectral radius of trees with given matching number
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- Trees with minimal Laplacian coefficients
- Closed formulas for the number of small paths, independent sets and matchings in fullerenes
- On extremal unicyclic molecular graphs with maximal Hosoya index
- Ordering of Hosoya indices for unicyclic Hückel graphs
- On acyclic molecular graphs with maximal Hosoya index, energy, and short diameter
- Trees with \(m\)-matchings and the fourth and fifth minimal Hosoya index
- On maximal energy and Hosoya index of trees without perfect matching
- The proof of a conjecture concerning acyclic molecular graphs with maximal Hosoya index and diameter 4
This page was built for publication: Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371032)