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

Guixian Huang, Weihua He and Yuanyao Tan

Applied Mathematics and Computation, 2019, vol. 341, issue C, 348-357

Abstract: Let G be a connected graph. The edge k-partiteness of G is the minimum number of edges whose deletion from G yields a k-partite graph. The Kirchhoff index Kf(G) of G is the sum of the resistance distance between all unordered pairs of vertices. In this paper, we study the problem to determine the minimum Kirchhoff index of graphs with a given edge k-partiteness. First, we theoretically characterize the graphs with minimum Kirchhoff index in this graph family when the edge k-partiteness is not big compared to the number of vertices of G. Then we propose an exhaustive search algorithm to find the optimal graphs. At last, three strategies are used to reduce the computation complexity of our algorithm and several performance comparisons of these strategies are given.

Keywords: Kirchhoff index; Edge k-partiteness; Resistance distance; Exhaustive search (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318307744
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:341:y:2019:i:c:p:348-357

DOI: 10.1016/j.amc.2018.09.002

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().