14 citations · 64 across the 20 of their papers we have counts for
21 papers
The forbidden structure for zero forcing number
Carlos A. Alfaro, Michael D. Barrus, Sergio Gerardo Gómez-Galicia +5
The {\it zero forcing number} of a graph , , is a well-studied parameter which arises from a color changing process and has strong connections to {\it minimum rank}, {\it…
A characterization of all graphs cospectral to the double star
Emily Barranca, Michael D. Barrus
We examine the adjacency spectrum of trees with diameter three, also referred to as double stars. Using to denote a double star with and leaves at its respectiv…
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…
Distinguishing chromatic number of Hamiltonian circulant graphs
Michael D. Barrus, Jean Guillaume, Benjamin Lantz
The distinguishing chromatic number of a graph is the smallest number of colors needed to properly color the vertices of so that the trivial automorphism is the only symmet…
Cliques in realization graphs
Michael D. Barrus, Nathan Haronian
The realization graph of a degree sequence is the graph whose vertices are labeled realizations of , where edges join realizations that differ by swapping a…
The principal Erdős--Gallai differences of a degree sequence
Michael D. Barrus
The Erdős--Gallai criteria for recognizing degree sequences of simple graphs involve a system of inequalities. Given a fixed degree sequence, we consider the list of differences of…