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%2F00216208%3A11320%2F23%3A10477018" target="_blank" >RIV/00216208:11320/23:10477018 - isvavai.cz</a>

Výsledek na webu

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

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

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

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA22-17398S" target="_blank" >GA22-17398S: Toky a cykly v grafech na plochách</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications

ISBN

978-80-280-0344-9

ISSN

2788-3116

e-ISSN

—

Počet stran výsledku

7

Strana od-do

478-484

Název nakladatele

Masaryk University Press

Místo vydání

Masaryk University, Brno

Místo konání akce

Praha

Datum konání akce

28. 8. 2023

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

WRD - Celosvětová akce

Kód UT WoS článku

—