Estimating Robustness Through Kirchhoff Index in Mesh Graphs

The Kirchhoff index is a new measure of network robustness. In this paper, we study the robustness of$n \times m$mesh graphes (denoted by$M_{n\times m}$) by determining the most important edges and the least important edges. In other words, we aim to find the edges (denoted by$edge_{max}$) which have the biggest impact on the Kirchhoff index after the edge is deleted and the edges (denoted by$edge_{min}$) which have the least impact on Kirchhoff index after the edge is deleted. The distributions of$edge_{max}$and$edge_{min}$are fully characterized. Consequently, we propose a new strategy called modified resistance distance strategy to locate$edge_{max}$and$edge_{min}$of$M_{n\times m}$. The applicability and rationality of the modified resistance distance strategy in mesh graphs is proved by comparing with other known strategies, such as the semi-random strategy, the degree product strategy and the resistance distance strategy. Moreover, the modified resistance distance strategy is still applicable in mesh graphs when we use the algebraic connectivity as the measure of graph robustness.

Abstract licence: CC BY-NC-ND

24 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.