The (n,m)-graphs of minimum Hosoya index
From MaRDI portal
Publication:4897552
zbMATH Open1265.05496MaRDI QIDQ4897552FDOQ4897552
Authors: Xieng-Feng Pan, Zhi-Rong Sun 
Publication date: 19 December 2012
Recommendations
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (21)
- Title not available (Why is that?)
- A new proof of a result concerning a complete description of \((n, n + 2) \)-graphs with maximum value of the Hosoya index
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- On the Hosoya index of graphs
- Smallest Hosoya index in cycle-block graphs
- The smallest Hosoya index of bicyclic graphs with given pendent vertices
- Bounds of the Hosoya index in graphs
- The Hosoya index order of three type of special graphs
- On graphs whose Hosoya indices are primitive Pythagorean triples
- Hosoya index of splices, bridges, and necklaces
- Hosoya index of VDB-weighted graphs
- -MINIMUM SPANNING LENGTHS AND AN EXTENSION TO BURNSIDE’S THEOREM ON IRREDUCIBILITY
- The extremal generalized \(\theta \)-graphs with respect to Hosoya index.
- Sharp bounds on the permanental sum of a graph
- Threes with \(m\)-matchings and the third minimal Hosoya index
- The smallest hosoya index in \((n,n+1)\)-graphs
- The largest Hosoya index of \((n,n+1)\)-graphs
- Minimizing the \((2n,q)\)-graphs with perfect matchings in terms of the Hosoya index
- Number of induced matchings of graphs
- Ordering polygonal chains with respect to Hosoya index
- The Hosoya index and the Merrifield-Simmons 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)
