activity
20162026
most citedIrreducibility of generalized Fibonacci polynomials

3 citations · 6 across the 11 of their papers we have counts for

collaborators
Showing 2017Show all

5 papers · 1 filter

math.CO2017

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…

math.CO2017★ 3 cited

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…

math.CO2017

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…

math.CO2017

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…

math.CO2017

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…