3 citations · 4 across the 10 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
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 …
math.CO2020★ 3 cited
Distinguishing Generalized Mycielskian Graphs
Debra Boutin, Sally Cockburn, Lauren Keough +3
A graph is -distinguishable if there is a coloring of the vertices with colors so that only the trivial automorphism preserves the color classes. The smallest such i…
math.CO2020★ 1 cited
Distinguishing Orthogonality Graphs
Debra Boutin, Sally Cockburn
A graph is said to be -distinguishable if there is a labeling of the vertices with labels so that only the trivial automorphism preserves the labels. The smallest such $…