7 citations · 10 across the 6 of their papers we have counts for
6 papers
Closed Neighborhood Balanced Coloring of Graphs
K. L. Collins, M. Bowie, N. B. Fox +7
A coloring of the vertex set of a graph using the colors red and blue is a closed neighborhood balanced coloring if for each vertex there are an equal number of red and blue vertic…
The 2-burning number of a graph
C. B. Jacobs, M. E. Messinger, A. N. Trenk
We study a discrete-time model for the spread of information in a graph, motivated by the idea that people believe a story when they learn of it from two different origins. Similar…
The Hereditary Closure of the Unigraphs
Michael D. Barrus, Ann N. Trenk, Rebecca Whitman
A graph with degree sequence is a \emph{unigraph} if it is isomorphic to every graph that has degree sequence . The class of unigraphs is not hereditary and in this paper we…
Unit Interval Orders of Open and Closed Intervals
Alan Shuchat, Randy Shull, Ann Trenk
A poset is a unit OC interval order if there exists a representation that assigns an open or closed real interval of unit length to each so that $x…
Unit Mixed Interval Graphs
Alan Shuchat, Randy Shull, Ann N. Trenk +1
In this paper we extend the work of Rautenbach and Szwarcfiter by giving a structural characterization of graphs that can be represented by the intersection of unit intervals that…
Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number
Karen L. Collins, Ann Trenk
Nordhaus and Gaddum proved, for any graph G, that the chromatic number of G plus the chromatic number of G complement is less than or equal to the number of vertices in G plus 1. F…