Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge k-partiteness

DOI10.1016/J.AMC.2018.09.002MaRDI QIDQ2007806zbMATH OpenOpenAlexFDO

Authors Guixian Huang, Weihua He, Yuanyao Tan

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

zbMATH Keywords

Kirchhoff indexresistance distanceexhaustive searchedge \(k\)-partiteness

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12)

Recommendations

• On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness
• On the minimum Kirchhoff index of graphs with given number of cut-edges
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
• On the minimum Kirchhoff index of graphs with a fixed number of cut vertices
• On the Kirchhoff index of the complement of a bipartite graph

Cites work

• scientific article; zbMATH DE number 5627524 (Why is no real title available?)
• Bounds for the Kirchhoff index via majorization techniques
• Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index
• Computing lower bounds for the Kirchhoff index via majorization techniques
• Effective graph resistance
• Graph theory with applications
• Kirchhoff index of composite graphs
• Laplacian matrices of graphs: A survey
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
• On Laplacian-energy-like invariant and Kirchhoff index
• On extremal bipartite unicyclic graphs
• On resistance-distance and Kirchhoff index
• On the Kirchhoff index of the complement of a bipartite graph
• On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness
• Resistance distance in subdivision-vertex join and subdivision-edge join of graphs
• Resistance distances and the Kirchhoff index in Cayley graphs
• Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index
• Some additional bounds for the Kirchhoff index
• The Kirchhoff indices and the matching numbers of unicyclic graphs
• The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains
• The second maximal and minimal Kirchhoff indices of unicyclic graphs

Cited in

(6)

• On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis
• Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs
• On the Kirchhoff index of bipartite graphs with given diameters
• On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision
• Computation of resistance distance and Kirchhoff index of the two classes of silicate networks
• Extremal pentagonal chains with respect to the Kirchhoff index

This page was built for publication: Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge \(k\)-partiteness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007806)