1 citations · 2 across the 4 of their papers we have counts for
7 papers
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…
A guide to choosing and implementing reference models for social network analysis
Elizabeth A. Hobson, Matthew J. Silk, Nina H. Fefferman +4
Analyzing social networks is challenging. Key features of relational data require the use of non-standard statistical methods such as developing system-specific null, or reference,…
Guessing Numbers and Extremal Graph Theory
Jo Martin, Puck Rombach
For a given number of colors, , the guessing number of a graph is the (base ) logarithm of the cardinality of the largest family of colorings of the vertex set of the graph s…
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 …
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…
Lower bounds for rainbow Turán numbers of paths and other trees
Daniel Johnston, Puck Rombach
For a fixed graph , we would like to determine the maximum number of edges in a properly edge-colored graph on vertices which does not contain a rainbow copy of , that is…