On the structure and values of betweenness centrality in dense betweenness-uniform graphs

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

On the structure and values of betweenness centrality in dense betweenness-uniform graphs

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

On the structure and values of betweenness centrality in dense betweenness-uniform graphs

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10101 - Pure mathematics

Projekt

<a href="/cs/project/GA23-07074S" target="_blank" >GA23-07074S: Symetrie mozkové konektivity</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2023

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

EUROCOMB’23. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications

ISBN

—

ISSN

2788-3116

e-ISSN

2788-3116

Počet stran výsledku

7

Strana od-do

478-484

Název nakladatele

MUNI Press

Místo vydání

Brno

Místo konání akce

Prague

Datum konání akce

28. 8. 2023

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—