Centrality measures-based sensitivity analysis and entropy of nonzero component graphs
-
Published:2024-05-14
Issue:
Volume:
Page:
-
ISSN:1793-8309
-
Container-title:Discrete Mathematics, Algorithms and Applications
-
language:en
-
Short-container-title:Discrete Math. Algorithm. Appl.
Author:
Mathew Vrinda Mary1ORCID,
Naduvath Sudev1ORCID
Affiliation:
1. Department of Mathematics, CHRIST (Deemed to be University), Bangalore 560029, Karnataka, India
Abstract
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.
Funder
critical and creative suggestions given by her fellow researchers
Publisher
World Scientific Pub Co Pte Ltd