13 citations · 15 across the 5 of their papers we have counts for
5 papers
Low Diameter Monochromatic Covers of Complete Multipartite Graphs
Sean English, Connor Mattes, Grace McCourt +1
Let the diameter cover number, , denote the least integer such that under any -coloring of the edges of the graph , there exists a collection of monochromat…
Inducibility of the Net Graph
Adam Blumenthal, Michael Phillips
A graph is called a fractalizer if for all the only graphs which maximize the number of induced copies of on vertices are the balanced iterated blow ups of . Whi…
Inducibility of 4-vertex tournaments
Dalton Burke, Bernard Lidický, Florian Pfender +1
We determine the inducibility of all tournaments with at most vertices together with the extremal constructions. The -vertex tournament containing an oriented and one…
Hadamard diagonalizable graphs of order at most 36
Jane Breen, Steve Butler, Melissa Fuentes +7
If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries , then the matrix formed by taking the columns as the eigenvectors is a Hadamard mat…
The zero forcing polynomial of a graph
Kirk Boyer, Boris Brimkov, Sean English +5
Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to beco…