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

DOI10.1016/J.AMC.2018.09.002zbMATH Open1428.05295OpenAlexW2892387482MaRDI QIDQ2007806FDOQ2007806

Yuanyao Tan, Weihua 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

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

zbMATH Keywords

Kirchhoff indexresistance distanceexhaustive searchedge \(k\)-partiteness

Mathematics Subject Classification ID

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

Cites Work

• On resistance-distance and Kirchhoff index
• Laplacian matrices of graphs: A survey
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Resistance distances and the Kirchhoff index in Cayley graphs
• Title not available (Why is that?)
• The Kirchhoff indices and the matching numbers of unicyclic graphs
• Title not available (Why is that?)
• Kirchhoff index of composite graphs
• On the Kirchhoff index of the complement of a bipartite graph
• Title not available (Why is that?)
• Effective graph resistance
• The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains
• Title not available (Why is that?)
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
• Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index
• On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness
• Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index

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)