activity
20082024
most citedDistinguishing Generalized Mycielskian Graphs

3 citations · 4 across the 9 of their papers we have counts for

collaborators

11 papers

math.CO2024

Geochromatic Number when Crossings are Independent

Debra Boutin, Alice Dean

A geometric graph, , is a graph drawn in the plane, with straight line edges and vertices in general position. A geometric homomorphism between two geometric graphs $…

math.CO2021

Symmetry Parameters of Various Hypercube Families

Debra Boutin, Sally Cockburn, Lauren Keough +2

In this paper we study the symmetry parameters determining number, distinguishing number, and cost of 2-distinguishing, for some variations on hypercubes, namely Hamming graphs, po…

math.CO2021

Paint Cost and the Frugal Distinguishing Number

Debra Boutin

You are handed a graph with vertices in a neutral color and asked to color a subset of vertices with expensive paints in colors in such a way that only the trivial symmetry pre…

math.CO2021

Symmetry Parameters for Mycielskian Graphs

Debra Boutin, Sally Cockburn, Lauren Keough +3

The Mycielskian construction, denoted , takes a finite simple graph to a larger graph with of the same clique number but larger chromatic number. The generalized Mycielsk…

math.CO2020

The Cost of 2-Distinguishing Hypercubes

Debra Boutin

A graph is said to be {\it -distinguishable} if there is a labeling of the vertices with two labels so that only the trivial automorphism preserves the labels. The minimum s…

math.CO2020

Determining Number and Cost of Generalized Mycielskian Graphs

Debra Boutin, Sally Cockburn, Lauren Keough +3

A set of vertices is a determining set for a graph if every automorphism of is uniquely determined by its action on . The size of a smallest determining set for …