On the connectivity and the diameter of betweenness-uniform graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F24%3A00576896" target="_blank" >RIV/67985807:_____/24:00576896 - isvavai.cz</a>
Result on the web
<a href="https://dx.doi.org/10.1016/j.dam.2023.08.017" target="_blank" >https://dx.doi.org/10.1016/j.dam.2023.08.017</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2023.08.017" target="_blank" >10.1016/j.dam.2023.08.017</a>

Result language
angličtina
Original language name
On the connectivity and the diameter of betweenness-uniform graphs
Original language description
Betweenness centrality is a centrality measure based on the overall amount of shortest paths passing through a given vertex. A graph is betweenness-uniform if all its vertices have the same betweenness centrality. We study the properties of betweenness-uniform graphs. In particular, we show that every connected betweenness-uniform graph is either a cycle or a 3-connected graph. Also, we show that betweenness uniform graphs of high maximal degree have small diameter.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

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

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

Similar results(10)