1 citations · 3 across the 16 of their papers we have counts for
5 papers · 1 filter
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…
Rainbow Saturation
Neal Bushaw, Daniel Johnston, Puck Rombach
We introduce a notion of rainbow saturation and the corresponding rainbow saturation number. This is the saturation version of the rainbow Turán numbers whose systematic study was…