Centrality-based graph entropy and sensitivity analysis of n-inordinate invariant intersection graphs

Centrality is a real-valued function on the vertex set of a graph that helps in determining the vitality of its vertices. Graph entropy gives the structural information of complex networks, based on some information of the network entities. An algebraic intersection graph called the [Formula: see text]-inordinate invariant intersection graph has been constructed from the symmetric group and its structural properties are being studied, in the literature. In this paper, we discuss the centrality measures and the graph entropy of the [Formula: see text]-inordinate invariant intersection graphs and their complements, and analyze the sensitivity of these networks, based on the centrality measures of their vertices.