2 citations · 3 across the 7 of their papers we have counts for
6 papers · 1 filter
Uniform Edge Betweenness Centrality
Heather A. Newman, Hector Miranda, Rigoberto Florez +1
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 investiga…
Edge-Transitive Graphs
Heather A. Newman, Hector Miranda, Darren A. Narayan
A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. I…
Extrema Property of the -Ranking of Directed Paths and Cycles
Breeanne Baker Swart, Rigoberto Flórez, Darren A. Narayan +1
A -ranking of a directed graph is a labeling of the vertex set of with positive integers such that every directed path connecting two vertices with the same label in…
Maximizing the number of edges in optimal -rankings
Rigoberto Florez, Darren A. Narayan
A -ranking is a vertex -coloring such that if two vertices have the same color any path connecting them contains a vertex of larger color. The rank number of a graph is small…
Relationships Between Characteristic Path Length, Efficiency, Clustering Coefficients, and Graph Density
Alexander Strang, Oliver Haynes, Nathan D. Cahill +1
The graph theoretic properties of the clustering coefficient, characteristic (or average) path length, global and local efficiency, provide valuable information regarding the struc…
A Graph Theoretic Analysis of Leverage Centrality
Roger Vargas, Abigail Waldron, Anika Sharma +2
In 2010, Joyce et. al defined the leverage centrality of vertices in a graph as a means to analyze functional connections within the human brain. In this metric a degree of a verte…