Measuring Vertex Centrality Using the Holevo Quantity
From MaRDI portal
Publication:5082149
DOI10.1007/978-3-319-58961-9_14zbMath1489.68204OpenAlexW2613108585WikidataQ62039527 ScholiaQ62039527MaRDI QIDQ5082149
Publication date: 15 June 2022
Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://publications.aston.ac.uk/id/eprint/30934/1/main.pdf
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph
- Attributed Graph Similarity from the Quantum Jensen-Shannon Divergence
- Interpreting the von Neumann entropy of graph Laplacians, and coentropic graphs
- Quantum Computation and Quantum Information
- Emergence of Scaling in Random Networks
This page was built for publication: Measuring Vertex Centrality Using the Holevo Quantity