Showing math.COShow all
2 papers · 1 filter
math.CO2023
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…
math.CO2023
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…