The (n,m)-graphs of minimum Hosoya index
From MaRDI portal
Publication:4897552
Recommendations
Cited in
(21)- Smallest Hosoya index in cycle-block graphs
- Hosoya index of VDB-weighted graphs
- The smallest hosoya index in \((n,n+1)\)-graphs
- scientific article; zbMATH DE number 6262659 (Why is no real title available?)
- Number of induced matchings of graphs
- On the Hosoya index of graphs
- The extremal generalized \(\theta \)-graphs with respect to Hosoya index.
- The largest Hosoya index of \((n,n+1)\)-graphs
- The Hosoya index order of three type of special graphs
- Bounds of the Hosoya index in graphs
- Minimizing the \((2n,q)\)-graphs with perfect matchings in terms of the Hosoya index
- Sharp bounds on the permanental sum of a graph
- On graphs whose Hosoya indices are primitive Pythagorean triples
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- Ordering polygonal chains with respect to Hosoya index
- A new proof of a result concerning a complete description of \((n, n + 2) \)-graphs with maximum value of the Hosoya index
- The Hosoya index and the Merrifield-Simmons index
- -MINIMUM SPANNING LENGTHS AND AN EXTENSION TO BURNSIDE’S THEOREM ON IRREDUCIBILITY
- Hosoya index of splices, bridges, and necklaces
- The smallest Hosoya index of bicyclic graphs with given pendent vertices
- Threes with \(m\)-matchings and the third minimal Hosoya index
This page was built for publication: The \((n,m)\)-graphs of minimum Hosoya index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4897552)
