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

Title

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

Creator

Madhumitha, S.; Naduvath, Sudev

Description

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 n-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 n-inordinate invariant intersection graphs and their complements, and analyze the sensitivity of these networks, based on the centrality measures of their vertices. 2020 World Scientific Publishing Company.

Source

Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550083;

Date

01-01-2025

Publisher

World Scientific

Subject

centrality measures; entropy; Invariant intersection graph; n-inordinate invariant intersection graphs; sensitivity analysis

Coverage

Madhumitha S., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India

Rights

Restricted Access; Hardcopy may be available in the library

Relation

ISSN: 17938309;

Format

online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S1793830925500831

https://www.scopus.com/pages/publications/105007329302?origin=resultslist