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 2013Show all

4 papers · 1 filter

math.CO2013

A generalization of the extremal function of the Davenport-Schinzel sequences

Kok Bin Wong, Cheng Yeaw Ku

Let $[n] = {1, \dots, n}$ . A sequence $u = a_{1} a_{2} \dots a_{l}$ over $[n]$ is called $k$ -sparse if $a_{i} = a_{j}$ , $i > j$ implies $i - j \geq k$ . In other words, every consecutive subsequenc…

math.CO2013

An Analogue of the Hilton-Milner Theorem for weak compositions

Kok Bin Wong, Cheng Yeaw Ku

Let $N_{0}$ be the set of non-negative integers, and let $P (n, l)$ denote the set of all weak compositions of $n$ with $l$ parts, i.e., $P(n,l)=\{ (x_1,x_2,\dots, x_l)\in\math…

math.CO2013

On the eigenvalues of certain Cayley graphs and arrangement graphs

Bai Fan Chen, Ebrahim Ghorbani, Kok Bin Wong

In this paper, we show that the eigenvalues of certain classes of Cayley graphs are integers. The (n,k,r)-arrangement graph A(n,k,r) is a graph with all the k-permutations of an n-…

math.CO2013

Cyclic decomposition of k-permutations and eigenvalues of the arrangement graphs

Bai Fan Chen, Ebrahim Ghorbani, Kok Bin Wong

The (n,k)-arrangement graph A(n,k) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are adjacent if they agree in exactly k-1 positio…