Kok Bin Wong

activity

20082025

D

-graphs for Nonzero Roots of the Matching Polynomial

3 citations · 5 across the 12 of their papers we have counts for

collaborators

Showing 2009Show all

3 papers · 1 filter

math.CO2009

Properties of $θ$ -super positive graphs

Cheng Yeaw Ku, Kok Bin Wong

Let the matching polynomial of a graph $G$ be denoted by $μ (G, x)$ . A graph $G$ is said to be $θ$ -super positive if $μ (G, θ) \neq = 0$ and $μ (G ∖ v, θ) = 0$ for all $v \in V (G)$ . In…

math.CO2009★ 3 cited

Generalized $D$ -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 $D (G)$ , called the $D$ -graph of $G$ , which has been useful in investigating the structura…

math.CO2009

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 $θ$ -…

Properties of θ-super positive graphs

Generalized D-graphs for Nonzero Roots of the Matching Polynomial

Extensions of Barrier Sets to Nonzero Roots of the Matching Polynomials

Properties of $θ$ -super positive graphs

Generalized $D$ -graphs for Nonzero Roots of the Matching Polynomial