Hamilton College

output

19952026

most citedSDSS-III: Massive Spectroscopic Surveys of the Distant Universe, the Milky Way Galaxy, and Extra-Solar Planetary Systems

2.2k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

11 papers · 1 filter

math.CO2022

Edge Determining Sets and Determining Index

Sean McAvoy, Sally Cockburn

A graph automorphism is a bijective mapping of the vertices that preserves adjacent vertices. A vertex determining set of a graph is a set of vertices such that the only automorphi…

math.CO2021★ 1 cited

Extremal problems of double stars

Ervin Győri, Runze Wang, Spencer Woolfson

In a generalized Turán problem, two graphs $H$ and $F$ are given and the question is the maximum number of copies of $H$ in an $F$ -free graph of order $n$ . In this paper, we study…

math.CO2020

On lengths of burn-off chip-firing games

P. Mark Kayll, Dave Perkins

We continue our studies of burn-off chip-firing games from [Discrete Math. Theor. Comput. Sci. 15 (2013), no. 1, 121-132; MR3040546] and [Australas. J. Combin. 68 (2017), no. 3, 33…

math.CO2020★ 3 cited

Distinguishing Generalized Mycielskian Graphs

Debra Boutin, Sally Cockburn, Lauren Keough +3

A graph $G$ is $d$ -distinguishable if there is a coloring of the vertices with $d$ colors so that only the trivial automorphism preserves the color classes. The smallest such $d$ i…

math.CO2020★ 1 cited

Distinguishing Orthogonality Graphs

Debra Boutin, Sally Cockburn

A graph $G$ is said to be $d$ -distinguishable if there is a labeling of the vertices with $d$ labels so that only the trivial automorphism preserves the labels. The smallest such $…

math.CO2015

Homomorphic Preimages of Geometric Cycles

Sally Cockburn

A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the…

math.CO2015

Critical Pebbling Numbers of Graphs

Courtney R. Gibbons, Joshua D. Laison, Erick J. Paul

We define three new pebbling parameters of a connected graph $G$ , the $r$ -, $g$ -, and $u$ -critical pebbling numbers. Together with the pebbling number, the optimal pebbling number,…

math.CO2014

Identifying Codes on Directed De Bruijn Graphs

Debra Boutin, Victoria Horan Goliber, Mikko Pelto

For a directed graph $G$ , a $t$ -identifying code is a subset $S \subseteq V (G)$ with the property that for each vertex $v \in V (G)$ the set of vertices of $S$ reachable from $v$ by a…

math.CO2011

Posets of Geometric Graphs

Debra L. Boutin, Sally Cockburn, Alice Dean +1

A geometric graph G(bar) is a simple graph drawn in the plane, on points in general position, with straight-line edges. We call G(bar) a geometric realization of the underlying abs…

math.CO2010

The Homomorphism Poset of K_{2,n}

Sally Cockburn, Yonghyun Song

A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position. Two geometric realizations of a simple graph ar…

math.CO2008

Determining sets, resolving sets, and the exchange property

Debra Boutin

A subset U of vertices of a graph G is called a determining set if every automorphism of G is uniquely determined by its action on the vertices of U. A subset W is called a resolvi…