6 citations · 7 across the 7 of their papers we have counts for
9 papers
Well-covered Token Graphs
F. M. Abdelmalek, Esther Vander Meulen, Kevin N. Vander Meulen +1
The -token graph is the graph whose vertices are the -subsets of vertices of a graph , with two vertices of adjacent if their symmetric difference is an…
Bounds on polynomial roots using intercyclic companion matrices
Kevin N. Vander Meulen, Trevor Vanderwoerd
The Frobenius companion matrix, and more recently the Fiedler companion matrices, have been used to provide lower and upper bounds on the modulus of any root of a polynomial …
Bordering for spectrally arbitrary sign patterns
Dale Olesky, Pauline van den Driessche, Kevin N. Vander Meulen
We develop a matrix bordering technique that can be applied to an irreducible spectrally arbitrary sign pattern to construct a higher order spectrally arbitrary sign pattern. This…
Spectrally arbitrary pattern extensions
In-Jae Kim, Bryan L. Shader, Kevin N. Vander Meulen +1
A matrix pattern is often either a sign pattern with entries in {0,+,-} or, more simply, a nonzero pattern with entries in {0,*}. A matrix pattern A is spectrally arbitrary if for…
Shellability, vertex decomposability, and lexicographical products of graphs
Kevin N. Vander Meulen, Adam Van Tuyl
We investigate when the independence complex of , the lexicographical product of two graphs and , is either vertex decomposable or shellable. As an application, we con…
Independence complexes of well-covered circulant graphs
Jonathan Earl, Kevin N. Vander Meulen, Adam Van Tuyl
We study the independence complexes of families of well-covered circulant graphs discovered by Boros-Gurvich-Milanič, Brown-Hoshino, and Moussi. Because these graphs are well-cover…