activity
20182021
most citedThe iterated local transitivity model for hypergraphs

1 citations · 1 across the 7 of their papers we have counts for

collaborators

14 papers

math.CO2021

The localization capture time of a graph

Natalie C. Behague, Anthony Bonato, Melissa A. Huggan +2

The localization game is a pursuit-evasion game analogous to Cops and Robbers, where the robber is invisible and the cops send distance probes in an attempt to identify the locatio…

math.CO2021

The combinatorial game nofil played on Steiner Triple Systems

Melissa A. Huggan, Svenja Huntemann, Brett Stevens

We introduce an impartial combinatorial game on Steiner triple systems called Nofil. Players move alternately, choosing points of the triple system. If a player is forced to fill a…

math.CO2021

Progress on the localization number of a graph

Anthony Bonato, Melissa A. Huggan, Trent G. Marbach

We highlight new results on the localization number of a graph, a parameter derived from the localization graph searching game. After introducing the game and providing an overview…

math.CO2021

The game of Flipping Coins

Anthony Bonato, Melissa A. Huggan, Richard J. Nowakowski

We consider Flipping Coins, a partizan version of the impartial game Turning Turtles, played on lines of coins. We show the values of this game are numbers, and these are found by…

math.CO2021

An investigation into the application of genetic programming to combinatorial game theory

Melissa A. Huggan, Craig Tennenhouse

Genetic programming is the practice of evolving formulas using crossover and mutation of genes representing functional operations. Motivated by genetic evolution we develop and sol…

cs.DM20211 cited

The iterated local transitivity model for hypergraphs

Natalie C. Behague, Anthony Bonato, Melissa A. Huggan +2

Complex networks are pervasive in the real world, capturing dyadic interactions between pairs of vertices, and a large corpus has emerged on their mining and modeling. However, man…