Note on two Kirchhoff index Turán problems
From MaRDI portal
Cites work
- A new technique for the characterization of graphs with a maximum number of spanning trees
- Bounds on the resistance distance and Kirchhoff index of graphs
- Effective graph resistance
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Extremal numbers for odd cycles
- scientific article; zbMATH DE number 5627524 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Kirchhoff index and degree Kirchhoff index of complete multipartite graphs
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- On the minimum Kirchhoff index of graphs with a given number of cut vertices
- On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness
- Spectral extrema for graphs: the Zarankiewicz problem
- Spectral extremal graphs for disjoint cliques
- The Kirchhoff indices and the matching numbers of unicyclic graphs
This page was built for publication: Note on two Kirchhoff index Turán problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859902)