Research

research.html for my new research page.

Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality, October 2021 (with Joe Sawada and Aaron Williams)
Cut-Down de Bruijn Sequences, October 2021 (with Aysu Gündoğan and Joe Sawada) [preprint]
On the largest real root of the independence polynomial of a unicyclic graph, March 2021 (with Iain Beaton) [arXiv]

The node cop-win reliability of unicyclic and bicyclic graphs, Networks (with Maimoonah Ahmed) [DOI] [arXiv]
Dichotomizing k-vertex-critical H-free graphs for H of order four, to appear in Discrete Applied Mathematics (with Chính Hoàng and Joe Sawada) [arXiv] [critical graph files]
On the Mean Subtree Order of Graphs Under Edge Addition, Journal of Graph Theory 96(3): 403– 413 (2021) (with Lucas Mol) [DOI] [arXiv]
A note on purely imaginary independence roots, Discrete Mathematics 343(12): 112113 (2020) (with Jason Brown) [DOI] [arXiv]
Maximum Modulus of Independence Roots of Graphs and Trees, Graphs and Combinatorics 36(3): 877-894 (2020) (with Jason Brown) [DOI] [arXiv] [journal version (view only)]
Independence equivalence classes of paths and cycles, Australasian Journal of Combinatorics 75(1): 127-145 (2019) (with Jason Brown and Iain Beaton) [Open access]
On the unimodality of independence polynomials of very well-covered graphs, Discrete Mathematics 341(4): 1138–1143 (2018) (with Jason Brown) [DOI] [arXiv]
On the Stability of Independence Polynomials, The Electronic Journal of Combinatorics 25#P1.46 18pp. (2018) (with Jason Brown) [Open access]
Edge contraction and cop-win critical graphs, Australasian Journal of Combinatorics 63(1): 70-87 (2015) (with Shannon Fitzpatrick) [Open access]

A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph, to appear in COCOON 2021: Proceedings from 27th International Computing and Combinatorics Conference, LNCS 13025: 49-60 (2021) (with Aaron Grubb and Joe Sawada) [DOI] [arXiv]
A Hamilton Cycle in the k-Sided Pancake Network, IWOCA 2021: Proceedings from the 32nd International Workshop on Combinatorial Algorithms , LNCS 12757:137-151 (2021) (with Joe Sawada and Aaron Williams) [DOI] [arXiv] [C implementations of algorithms] [video of Joe's presentation]

Select Talks

The largest real root of the independence polynomial of a unicyclic graph, Graph Polynomials Minisymposium, CanaDAM 2021, Virtual (formerly University of Manitoba), May 2021.
The mean subtree order of a graph under edge addition, Graph Theory Session, CMS Winter Meeting, Virtual, December 2020.
Families of graphs containing only finitely many vertex-critical graphs, Atlantic Graph Theory Seminar, Virtual, October 2020. video
Dichotomizing k-vertex-critical H-free graphs for H of order four, Special Session on Combinatorics and Computing, AMS Fall Eastern Sectional Meeting, Virtual (formerly Pennsylvania State University), October 2020.
Independence Equivalence Classes of Paths and Cycles, G@R Seminar, Ryerson University, February 2020.
The Maximum Modulus of an Independence Root, Graph Polynomials Minisymposium, CanaDAM 2019, Simon Fraser University, June 2019.
On the Stability of Independence Polynomials, Graph Polynomials Minisymposium, SIAM DM 18, University of Colorado, Denver, June 2018.
The Independence Roots of a Graph, East Coast Combinatorics Conference, Dalhousie University, May 2018.
On the Unimodality of Independence Polynomials of Very Well-Covered Graphs, Graph Polynomials Minisymposium, CanaDAM 2017, Ryerson University, June 2017.
Graph Properties, Polynomials, and Simplicial Complexes, Graduate Student Research Session, CMS Summer Meeting, University of Prince Edward Island, June 2015.

On the Roots of Independence Polynomials, PhD thesis, Dalhousie University (2019) [DalSpace]
P-Generating Polynomials and the P-Fractal of a Graph, MSc Thesis, Dalhousie University (2014) [DalSpace]

Coauthors in alphabetical order by last name:

* indicates coauthor is/was my student