3 citations · 3 across the 4 of their papers we have counts for
4 papers
Generalized -graphs for Nonzero Roots of the Matching Polynomial
Cheng Yeaw Ku, Kok Bin Wong
Recently, Bauer et al. (J Graph Theory 55(4) (2007), 343--358) introduced a graph operator , called the -graph of , which has been useful in investigating the structura…
Extensions of Barrier Sets to Nonzero Roots of the Matching Polynomials
Cheng Yeaw Ku, Kok Bin Wong
In matching theory, barrier sets (also known as Tutte sets) have been studied extensively due to its connection to maximum matchings in a graph. In this paper, we first define -…
An Analogue of the Gallai-Edmonds Structure Theorem for Nonzero Roots of the Matching Polynomial
Cheng Yeaw Ku, William Chen
Godsil observed the simple fact that the multiplicity of 0 as a root of the matching polynomial of a graph coincides with the classical notion of deficiency. From this fact he aske…
Eigenvalues of the Derangement Graph
Cheng Yeaw Ku, David B. Wales
We consider the Cayley graph on the symmetric group Sn generated by derangements. It is well known that the eigenvalues of this grpah are indexed by partitions of n. We investigate…