On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness
From MaRDI portal
Publication:1740156
DOI10.1016/j.amc.2017.07.067zbMath1426.05074OpenAlexW2744930430MaRDI QIDQ1740156
Shuofa Xiao, Hao Li, Wei-Hua He
Publication date: 29 April 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.07.067
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items
Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance, On the Kirchhoff index of bipartite graphs with given diameters, On the extremal cacti of given parameters with respect to the difference of Zagreb indices, The (degree-) Kirchhoff indices in random polygonal chains, Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge \(k\)-partiteness, Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices, Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum, Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index, Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index
Cites Work
- On the Kirchhoff index of the complement of a bipartite graph
- Resistance distances and the Kirchhoff index in Cayley graphs
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Kirchhoff index of composite graphs
- On resistance-distance and Kirchhoff index
- Laplacian matrices of graphs: A survey
- The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains
- The Kirchhoff indices and the matching numbers of unicyclic graphs
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- Bounds for the Kirchhoff index via majorization techniques
- Resistance distance in subdivision-vertex join and subdivision-edge join of graphs
- On extremal bipartite unicyclic graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item