Kok Bin Wong

Orcid: 0000-0001-5640-4432

According to our database1, Kok Bin Wong authored at least 32 papers between 2009 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Diversity and intersecting theorems for weak compositions.
Discret. Math., 2025

2024
Symmetric Reverse n-Derivations on Ideals of Semiprime Rings.
Axioms, 2024

2023
On Optimal and Quantum Code Construction from Cyclic Codes over FqPQ with Applications.
Entropy, August, 2023

Rewriting system of certain semigroups with three generators.
Appl. Algebra Eng. Commun. Comput., May, 2023

New Generalization of Metric-Type Spaces - Strong Controlled.
Symmetry, February, 2023

Alternating sign property of the perfect matching derangement graph.
J. Comb. Theory A, 2023

2021
On the Number of Nonnegative Sums for Semi-partitions.
Graphs Comb., 2021

On the Ramsey numbers for the tree graphs versus certain generalised wheel graphs.
Discret. Math., 2021

2020
Erdős-Ko-Rado theorems for set partitions with certain block size.
J. Comb. Theory A, 2020

2019
On Cross Parsons Numbers.
Graphs Comb., 2019

2018
On No-Three-In-Line Problem on m-Dimensional Torus.
Graphs Comb., 2018

2017
On the partition associated to the smallest eigenvalues of the k-point fixing graph.
Eur. J. Comb., 2017

Lazy cops and robbers on generalized hypercubes.
Discret. Math., 2017

2016
A non-trivial intersection theorem for permutations with fixed number of cycles.
Discret. Math., 2016

2015
On r-cross t-intersecting families for weak compositions.
Discret. Math., 2015

A Generalization of Very Odd Sequences.
Electron. J. Comb., 2015

A Deza-Frankl Type Theorem for Set Partitions.
Electron. J. Comb., 2015

2014
An Erdős-Ko-Rado Theorem for Permutations with Fixed Number of Cycles.
Electron. J. Comb., 2014

2013
On 2min-sets and 2minmax-sets with respect to certain cycles.
Period. Math. Hung., 2013

An analogue of the Hilton-Milner theorem for set partitions.
J. Comb. Theory A, 2013

Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph.
Eur. J. Comb., 2013

A Kruskal-Katona type theorem for integer partitions.
Discret. Math., 2013

Generalizing Tutte's theorem and maximal non-matchable graphs.
Discret. Math., 2013

An analogue of the Erdős-Ko-Rado theorem for weak compositions.
Discret. Math., 2013

Cyclic Decomposition of k-Permutations and Eigenvalues of the Arrangement Graphs.
Electron. J. Comb., 2013

2012
On Cross-Intersecting Families of Set Partitions.
Electron. J. Comb., 2012

Properties of θ-super positive graphs.
Electron. J. Comb., 2012

2011
The group marriage problem.
J. Comb. Theory A, 2011

Generalized D-graphs for nonzero roots of the matching polynomial.
Discret. Math., 2011

Maximum Multiplicity of Matching Polynomial Roots and Minimum Path Cover in General Graphs.
Electron. J. Comb., 2011

2010
Extensions of barrier sets to nonzero roots of the matching polynomial.
Discret. Math., 2010

2009
Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover.
Electron. J. Comb., 2009


  Loading...