8 citations · 9 across the 2 of their papers we have counts for
2 papers
math.CO2014★ 8 cited
Optimal open-locating-dominating sets in infinite triangular grids
Rex Kincaid, Allison Oldham, Gexin Yu
An open-locating-dominating set (OLD-set) is a subset of vertices of a graph such that every vertex in the graph has at least one neighbor in the set and no two vertices in the gra…
math.CO2013★ 1 cited
Algorithm and Complexity for a Network Assortativity Measure
Sarah J. Kunkler, M. Drew LaMar, Rex K. Kincaid +1
We show that finding a graph realization with the minimum Randić index for a given degree sequence is solvable in polynomial time by formulating the problem as a minimum weight per…