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

DOI10.1142/S1793830924500435MaRDI QIDQ6983264zbMATH OpenFDO

Authors Vrinda Mary Mathew, N. K. Sudev

Publication date 15 May 2025

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830924500435

zbMATH Keywords

centrality measuresentropysensitivity analysis

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30)

Cites work

• Coloring of non-zero component graphs
• From domination to coloring. Stephen Hedetniemi's graph theory and beyond
• Graph theory
• scientific article; zbMATH DE number 1888461 (Why is no real title available?)
• Nonzero Component Graph of a Finite Dimensional Vector Space
• On nonzero component graph of vector spaces over finite fields

This page was built for publication: Centrality measures-based sensitivity analysis and entropy of nonzero component graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983264)