On the structure and values of betweenness centrality in dense betweenness-uniform graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3A10477018" target="_blank" >RIV/00216208:11320/23:10477018 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-066" target="_blank" >https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-066</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.5817/CZ.MUNI.EUROCOMB23-066" target="_blank" >10.5817/CZ.MUNI.EUROCOMB23-066</a>
Alternative languages
Result language
angličtina
Original language name
On the structure and values of betweenness centrality in dense betweenness-uniform graphs
Original language description
Betweenness centrality is a network centrality measure based on the amount of shortest paths passing through a given vertex. A graph is betweenness-uniform (BUG) if all vertices have an equal value of betweenness centrality. In this contribution, we focus on betweenness-uniform graphs with betweenness centrality below one. We disprove a conjecture about the existence of a BUG with betweenness value for any rational number greater than 3/4,by showing that only very few betweenness centrality values below 6/7are attained for at least one BUG. Furthermore, among graphs with diameter at least three, there are no betweenness-uniform graphs with a betweenness centrality smaller than one. In graphs of smaller diameter, the same can be shown under a uniformity condition on the components of the complement.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA22-17398S" target="_blank" >GA22-17398S: Flows and cycles in graphs on surfaces</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications
ISBN
978-80-280-0344-9
ISSN
2788-3116
e-ISSN
—
Number of pages
7
Pages from-to
478-484
Publisher name
Masaryk University Press
Place of publication
Masaryk University, Brno
Event location
Praha
Event date
Aug 28, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—