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

被引：0

作者：

Mathew, Vrinda Mary ^{[1
]}

Naduvath, Sudev ^{[1
]}

机构：

[1] CHRIST Deemed Univ, Dept Math, Bangalore, Karnataka, India

来源：

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS | 2025年 / 17卷 / 03期

关键词：

Centrality measures; entropy; sensitivity analysis;

D O I：

10.1142/S1793830924500435

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页数：12

共 11 条

[1] Bondy J. A., 2008, Graph Theory, DOI [DOI 10.1007/978-1-84628-970-5, 10.1007/978-1-84628-970-5]
[2] Chartrand G., 2019, S HEDETNIEMIS GRAPH
[3] On nonzero component graph of vector spaces over finite fields
Das, Angsuman
[J]. JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2017, 16 (01)
[4] Nonzero Component Graph of a Finite Dimensional Vector Space
Das, Angsuman
[J]. COMMUNICATIONS IN ALGEBRA, 2016, 44 (09) : 3918 - 3926
[5] Mathew Vrinda Mary, 2021, Data Science and Security: Proceedings of IDSCS 2021. Lecture Notes in Networks and Systems (290), P266, DOI 10.1007/978-981-16-4486-3_29
[6] Mathew V. M., 2022, COMMUNICATED
[7] Mathew V. M., 2024, IN PRESS
[8] Ortega J. M. E., 2021, ARXIV
[9] Entropy Based Sensitivity Analysis and Visualization of Social Networks
Serin, Ekrem
Balcisoy, Selim
[J]. 2012 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), 2012, : 1099 - 1104
[10] Strang G., 1993, Introduction to linear algebra

← 1 2 →