Centrality measures-based sensitivity analysis and entropy of nonzero component graphs

Title

Centrality measures-based sensitivity analysis and entropy of nonzero component graphs

Creator

Mathew V.M.; Naduvath S.

Description

The nonzero component graph of a finite-dimensional vector space over a finite field is a graph whose vertices are the nonzero vectors in the vector space, and any two vertices are adjacent if the corresponding linear combination contains a common basis vector. In this paper, we discuss the centrality measures and entropy of the nonzero component graph and also analyze the sensitivity of the graph using the centrality measures. 2024 World Scientific Publishing Company.

Source

Discrete Mathematics, Algorithms and Applications

Date

2024-01-01

Publisher

World Scientific

Subject

Centrality measures; entropy; sensitivity analysis

Coverage

Mathew V.M., Department of Mathematics, CHRIST (Deemed to Be University), Karnataka, Bangalore, 560029, India; Naduvath S., Department of Mathematics, CHRIST (Deemed to Be University), Karnataka, Bangalore, 560029, India

Rights

Restricted Access

Relation

ISSN: 17938309

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S1793830924500435

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85193621171&doi=10.1142%2fS1793830924500435&partnerID=40&md5=b693546a471fdccb165ebcbd134b47f8