The second maximal and minimal Kirchhoff indices of unicyclic graphs
From MaRDI portal
Publication:3649832
zbMATH Open1199.05253MaRDI QIDQ3649832FDOQ3649832
Publication date: 4 December 2009
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)
Cited In (16)
- Bicyclic graphs with extremal cover cost
- New Nordhaus-Gaddum-type results for the Kirchhoff index
- On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness
- On the weighted reverse cover cost of trees and unicyclic graphs with given diameter
- Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge \(k\)-partiteness
- Bicyclic graphs with extremal Kirchhoff index
- On the Kirchhoff index of bipartite graphs with given diameters
- On the minimum Kirchhoff index of graphs with a fixed number of cut vertices
- Complete characterization of bicyclic graphs with minimal Kirchhoff index
- On the ordering of the Kirchhoff indices of the complements of trees and unicyclic graphs
- The Kirchhoff indices and the matching numbers of unicyclic graphs
- On the Kirchhoff index of graphs with diameter 2
- Unicyclic graphs with extremal Lanzhou index
- On the Kirchhoff index of the complement of a bipartite graph
- Some bounds for the Kirchhoff index of graphs
- Bounds for the Kirchhoff index of bipartite graphs
This page was built for publication: The second maximal and minimal Kirchhoff indices of unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3649832)
