3 citations · 6 across the 7 of their papers we have counts for
5 papers
Infinite Families of Asymmetric Graphs
Alejandra Brewer, Adam Gregory, Quindel Jones +2
A graph is \textit{asymmetric} if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963. They showed that the probability…
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…
Star of David and other patterns in the Hosoya-like polynomials triangles
Rigoberto Florez, Robinson A. Higuita, Antara Mukherjee
In this paper we first generalize the numerical recurrence relation given by Hosoya to polynomials. Using this generalization we construct a Hosoya-like triangle for polynomials, w…
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…