2020
DOI: 10.5614/ejgta.2020.8.2.7
|View full text |Cite
|
Sign up to set email alerts
|

Uniform edge betweenness centrality

Abstract: The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices passing through that edge. In this paper, we investigate graphs where the edge betweenness centrality of edges is uniform. It is clear that if a graph G is edge-transitive (its automorphism group acts transitively on its edges) then G has uniform edge betweenness centrality. However this sufficient condition is not necessary. Graphs that are not edge-transitive but have uniform edge bet… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…[3] Actually, any betweenness-uniform graph is 3-connected, unless it is isomorphic to a cycle. [5] There exist other studies concerned with both the values of betweenness in betweenness-uniform graphs [6] and edge betweenness-uniform graphs [8].…”
mentioning
confidence: 99%
“…[3] Actually, any betweenness-uniform graph is 3-connected, unless it is isomorphic to a cycle. [5] There exist other studies concerned with both the values of betweenness in betweenness-uniform graphs [6] and edge betweenness-uniform graphs [8].…”
mentioning
confidence: 99%