Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge \(k\)-partiteness
From MaRDI portal
Publication:2007806
DOI10.1016/j.amc.2018.09.002zbMath1428.05295OpenAlexW2892387482MaRDI QIDQ2007806
Yuanyao Tan, Wei-Hua He, Guixian Huang
Publication date: 22 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.09.002
Related Items
Computation of resistance distance and Kirchhoff index of the two classes of silicate networks, On the Kirchhoff index of bipartite graphs with given diameters, On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision, Extremal pentagonal chains with respect to 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
- Effective graph resistance
- 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
- On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness
- Bounds for the Kirchhoff index via majorization techniques
- Resistance distance in subdivision-vertex join and subdivision-edge join of graphs
- 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
- On extremal bipartite unicyclic graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
