31 citations · 31 across the 2 of their papers we have counts for
2 papers
math.CO2016
Coprime and prime labelings of graphs
Adam H. Berliner, Nathaniel Dean, Jonelle Hook +3
A coprime labeling of a simple graph of order is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken t…
math.CO2011★ 31 cited
Iteration Index of a Zero Forcing Set in a Graph
Kiran B. Chilakamarri, Nathaniel Dean, Cong X. Kang +1
Let each vertex of a graph G = (V(G), E(G)) be given one of two colors, say, "black" and "white". Let Z denote the (initial) set of black vertices of G. The color-change rule conve…