1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
On the Spectra of Chromatic Number and Chromatic Index of Cyclic Covers
Guantao Chen, Hein van der Holst, Rong Luo +1
For a fixed integer , we study what values of chromatic index and chromatic number can be attained by some -fold cyclic cover of a loopless multigraph. For edge-c…
Strong binding numbers and factors
Guantao Chen, Mikhail Lavrov, Yuying Ma +2
Let be a simple graph. The -th neighborhood of a vertex subset , denoted , is the set of vertices that are adjacent to at least vertices in …
The inverse eigenvalue problem for probe graphs
Emelie Curl, Jürgen Kritschgau, Carolyn Reinhart +1
In this paper, we initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe v…
Sparsity of Graphs that Allow Two Distinct Eigenvalues
Wayne Barrett, Shaun Fallat, Veronika Furst +5
The parameter of a graph is the minimum number of distinct eigenvalues over the family of symmetric matrices described by . It is shown that the minimum number of edg…