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%2F67985807%3A_____%2F23%3A00573762" target="_blank" >RIV/67985807:_____/23:00573762 - isvavai.cz</a>
Result on the web
<a href="https://journals.muni.cz/eurocomb/article/view/35600/31477" target="_blank" >https://journals.muni.cz/eurocomb/article/view/35600/31477</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αfrom the interval (3/4,∞) by showing that only very few betweenness centrality values below 6/7 are 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
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GA23-07074S" target="_blank" >GA23-07074S: Symmetries of brain connectivity</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
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
EUROCOMB’23. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications
ISBN
—
ISSN
2788-3116
e-ISSN
2788-3116
Number of pages
7
Pages from-to
478-484
Publisher name
MUNI Press
Place of publication
Brno
Event location
Prague
Event date
Aug 28, 2023
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—