15 citations · 52 across the 7 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
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…
math.CO2012★ 7 cited
Threshold Digraphs
Brian Cloteaux, M. Drew LaMar, Elizabeth Moseman +1
A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degr…
math.CO2009★ 9 cited
Algorithms for realizing degree sequences of directed graphs
M. Drew LaMar
The Havel-Hakimi algorithm for constructing realizations of degree sequences for undirected graphs has been used extensively in the literature. A result by Kleitman and Wang extend…