On the Connectivity and the Diameter of 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_____%2F21%3A00539647" target="_blank" >RIV/67985807:_____/21:00539647 - isvavai.cz</a>
Alternative codes found
RIV/00216208:11320/21:10437954
Result on the web
<a href="https://link.springer.com/book/10.1007/978-3-030-67899-9" target="_blank" >https://link.springer.com/book/10.1007/978-3-030-67899-9</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-67899-9_26" target="_blank" >10.1007/978-3-030-67899-9_26</a>
Alternative languages
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
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2021
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
Algorithms and Discrete Applied Mathematics
ISBN
978-3-030-67898-2
ISSN
0302-9743
e-ISSN
—
Number of pages
14
Pages from-to
317-330
Publisher name
Springer
Place of publication
Cham
Event location
Rupnagar
Event date
Feb 11, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—