Khee Meng Koh

Publication Activity (10 Years)

Years Active: 1973-2019
Publications (10 Years): 6

Top Topics

Cartesian Product

Connected Dominating Set

Top Venues

Electron. Notes Discret. Math.

AKCE Int. J. Graphs Comb.

Publications

Khee Meng Koh, Kian Wee Soh
On the power domination number of the Cartesian product of graphs. AKCE Int. J. Graphs Comb. 16 (3) (2019)
Khee Meng Koh, Kian Wee Soh
Power domination of the cartesian product of graphs. AKCE Int. J. Graphs Comb. 13 (1) (2016)
Andreas Dwi Maryanto Gunawan, Khee Meng Koh
The Nk-valued Roman Domination and Its Boundaries. Electron. Notes Discret. Math. 48 (2015)
Khee Meng Koh, Kian Wee Soh
Dominating Broadcast Labeling in Cartesian Products of Graphs. Electron. Notes Discret. Math. 48 (2015)
Khee Meng Koh, L. Y. Phoon, Kian Wee Soh
The gracefulness of the join of graphs (II). AKCE Int. J. Graphs Comb. 12 (Issues) (2015)
Khee Meng Koh, L. Y. Phoon, Kian Wee Soh
The Gracefulness of the Join of Graphs. Electron. Notes Discret. Math. 48 (2015)
Kian Wee Soh, Khee Meng Koh
Broadcast domination in graph products of paths. Australas. J Comb. 59 (2014)
Feng Ming Dong, Eng Guan Tay, Khee Meng Koh
Nowhere-zero 3-flows in Tensor Products of Graphs. Ars Comb. 117 (2014)
Zheng Shi, Khee Meng Koh
Counting the Number of Minimum Roman Dominating Functions of a Graph. CoRR (2014)
Khee Meng Koh, T. S. Ting
Reversing arcs in transitive tournaments to obtain maximum number of spanning cycles. Ars Comb. 112 (2013)
Khee Meng Koh, Zi-Xia Song
On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two. Graphs Comb. 29 (5) (2013)
Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi
Max-min total restrained domination number. Ars Comb. 112 (2013)
Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi
An Upper Bound for the Total Restrained Domination Number of Graphs. Graphs Comb. 29 (5) (2013)
Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi
On the total restrained domination edge critical graphs. Ars Comb. 109 (2013)
Feng Ming Dong, Khee Meng Koh
The 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial. J. Graph Theory 70 (3) (2012)
Khee Meng Koh, T. S. Ting, Feng Ming Dong
A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set. Australas. J Comb. 54 (2012)
Khee Meng Koh, T. S. Ting, Z. L. Xu, Feng Ming Dong
Lower bound on the weakly connected domination number of a cycle-disjoint graph. Australas. J Comb. 46 (2010)
Feng Ming Dong, Khee Meng Koh
On Zero-Free Intervals in (1, 2) of Chromatic Polynomials of Some Families of Graphs. SIAM J. Discret. Math. 24 (2) (2010)
Feng Ming Dong, Khee Meng Koh
Domination numbers and zeros of chromatic polynomials. Discret. Math. 308 (10) (2008)
Feng Ming Dong, Khee Meng Koh
A maximal zero-free interval for chromatic polynomials of bipartite planar graphs. Discret. Math. 308 (11) (2008)
Feng Ming Dong, Khee Meng Koh
Bounds For The Real Zeros of Chromatic Polynomials. Comb. Probab. Comput. 17 (6) (2008)
Khee Meng Koh, Chyan-Yee Goh, Feng Ming Dong
The maximum number of maximal independent sets in unicyclic connected graphs. Discret. Math. 308 (17) (2008)
Feng Ming Dong, Khee Meng Koh
On planar and non-planar graphs having no chromatic zeros in the interval (1, 2). Discret. Math. 308 (17) (2008)
Feng Ming Dong, Khee Meng Koh
Bounds for the coefficients of flow polynomials. J. Comb. Theory, Ser. B 97 (3) (2007)
Khee Meng Koh, Eng Guan Tay
On optimal orientations of tree vertex-multiplications. Australas. J Comb. 34 (2006)
Goh Chee Ying, Khee Meng Koh, Bruce E. Sagan, Vincent R. Vatter
cycles. J. Graph Theory 53 (4) (2006)
Feng Ming Dong, Khee Meng Koh
On Graphs Having No Chromatic Zeros in (1, 2). SIAM J. Discret. Math. 20 (3) (2006)
Khee Meng Koh, Kah Loon Ng
The orientation number of two complete graphs with linkages. Discret. Math. 295 (1-3) (2005)
Kah Loon Ng, Khee Meng Koh
On optimal orientation of cycle vertex multiplications. Discret. Math. 297 (1-3) (2005)
Feng Ming Dong, Khee Meng Koh
Two Results on Real Zeros of Chromatic Polynomials. Comb. Probab. Comput. 13 (6) (2004)
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh
Chromatically Unique Multibridge Graphs. Electron. J. Comb. 11 (1) (2004)
Feng Ming Dong, Khee Meng Koh
On upper bounds for real roots of chromatic polynomials. Discret. Math. 282 (1-3) (2004)
Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo
On the number of quasi-kernels in digraphs. J. Graph Theory 46 (1) (2004)
Feng Ming Dong, Khee Meng Koh, C. A. Soh
Divisibility of certain coefficients of the chromatic polynomials. Discret. Math. 275 (1-3) (2004)
Khee Meng Koh, Bock Boom Lim, Peter J. Slater
-domination in graphs. Discret. Math. 272 (1) (2003)
Feng Ming Dong, Kee L. Teo, Khee Meng Koh
A note on the chromaticity of some 2-connected (n, n+3)-graphs. Discret. Math. 243 (1-3) (2002)
Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo
Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs. Graphs Comb. 18 (3) (2002)
Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy
Non-chordal graphs having integral-root chromatic polynomials II. Discret. Math. 245 (1-3) (2002)
Khee Meng Koh, Eng Guan Tay
Optimal Orientations of Graphs and Digraphs: A Survey. Graphs Comb. 18 (4) (2002)
Khee Meng Koh, Eng Guan Tay
On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle. Discret. Math. 232 (1-3) (2001)
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, C. H. C. Little, Michael D. Hendy
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs. J. Graph Theory 37 (1) (2001)
Feng Ming Dong, Khee Meng Koh, Kee L. Teo
Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs. Graphs Comb. 17 (4) (2001)
Khee Meng Koh, Eng Guan Tay
On Optimal Orientations of Cartesian Products of Trees. Graphs Comb. 17 (1) (2001)
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
Chromatically unique bipartite graphs with low 3-independent partition numbers. Discret. Math. 224 (1-3) (2000)
Khee Meng Koh, Eng Guan Tay
vertex-multiplications. Discret. Math. 219 (1-3) (2000)
Khee Meng Koh, Eng Guan Tay
On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles. Discret. Math. 211 (2000)
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
An attempt to classify bipartite graphs by chromatic polynomials. Discret. Math. 222 (1-3) (2000)
Feng Ming Dong, Khee Meng Koh
Structures and chromaticity of some extremal 3-colourable graphs. Discret. Math. 203 (1-3) (1999)
Khee Meng Koh, Eng Guan Tay
On Optimal Orientations of Cartesian Products with a Bipartite Graph. Discret. Appl. Math. 98 (1-2) (1999)
Khee Meng Koh, Eng Guan Tay
On optimal orientations of cartesian products of graphs (I). Discret. Math. 190 (1-3) (1998)
Khee Meng Koh, Eng Guan Tay
On optimal orientations of Cartesian products of even cycles. Networks 32 (4) (1998)
Feng Ming Dong, Khee Meng Koh
On graphs in which any pair of colour classes but one induces a tree. Discret. Math. 169 (1-3) (1997)
Khee Meng Koh, B. P. Tan
The number of kings in a multipartite tournament. Discret. Math. (1997)
Khee Meng Koh, Kee L. Teo
The search for chromatically unique graphs - II. Discret. Math. 172 (1-3) (1997)
Feng Ming Dong, Khee Meng Koh
On the structure and chromaticity of graphs in which any two colour classes induce a tree. Discret. Math. 176 (1-3) (1997)
C. C. Chen, G. P. Jin, Khee Meng Koh
Triangle-Free Graphs with Large Degree. Comb. Probab. Comput. 6 (4) (1997)
C. C. Chen, G. L. Chia, Khee Meng Koh, N. Z. Li, Kee L. Teo
Preface. Discret. Math. 172 (1-3) (1997)
Khee Meng Koh, Eng Guan Tay
Optimal Orientations of Products of Paths and Cycles. Discret. Appl. Math. 78 (1-3) (1997)
Khee Meng Koh, Eng Guan Tay
On optimal orientations of Cartesian products of even cycles and paths. Networks 30 (1) (1997)
Khee Meng Koh, B. P. Tan
The diameter of an orientation of a complete multipartite graph [Discrete Math 149 (1996) 131-139]. Discret. Math. 173 (1-3) (1997)
Khee Meng Koh, Chung-Piaw Teo
Chromaticity of series-parallel graphs. Discret. Math. 154 (1-3) (1996)
Khee Meng Koh, B. P. Tan
The minimum diameter of orientations of complete multipartite graphs. Graphs Comb. 12 (1) (1996)
Khee Meng Koh, B. P. Tan
The diameter of an orientation of a complete multipartite graph. Discret. Math. 149 (1-3) (1996)
Khee Meng Koh, K. S. Poh
On the lower length of the closed-set lattice of a tree. Discret. Math. 151 (1-3) (1996)
Khee Meng Koh, B. P. Tan
Number of 4-kings in bipartite tournaments with no 3-kings. Discret. Math. 154 (1-3) (1996)
Khee Meng Koh, B. P. Tan
Kings in multipartite tournaments. Discret. Math. 147 (1-3) (1995)
Khee Meng Koh, Kee L. Teo
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles. Discret. Math. 127 (1-3) (1994)
Chung-Piaw Teo, Khee Meng Koh
On chromatic uniqueness of uniform subdivisions of graphs. Discret. Math. 128 (1-3) (1994)
C. C. Chen, Khee Meng Koh, Y. H. Peng
On the higher-order edge toughness of a graph. Discret. Math. 111 (1-3) (1993)
Chung-Piaw Teo, Khee Meng Koh
The number of shortest cycles and the chromatic uniqueness of a graph. J. Graph Theory 16 (1) (1992)
Khee Meng Koh, K. S. Poh
On the spectrum of the closed-set lattice of a graph. Australas. J Comb. 5 (1992)
Khee Meng Koh, Chung-Piaw Teo
The chromatic uniqueness of certain broken wheels. Discret. Math. 96 (1) (1991)
Khee Meng Koh, Kee L. Teo
The search for chromatically unique graphs. Graphs Comb. 6 (3) (1990)
Khee Meng Koh, B. H. Goh
Two classes of chromatically unique graphs. Discret. Math. 82 (1) (1990)
Chung-Piaw Teo, Khee Meng Koh
The chromaticity of complete bipartite graphs with at most one edge deleted. J. Graph Theory 14 (1) (1990)
Khee Meng Koh, Kee L. Teo
The 2-hamiltonian cubes of graphs. J. Graph Theory 13 (6) (1989)
Y. H. Peng, C. C. Chen, Khee Meng Koh
On the factor-thickness of regular graphs. Graphs Comb. 5 (1) (1989)
Khee Meng Koh, K. S. Poh
Constructions of sensitive graphs which are not strongly sensitive. Discret. Math. 72 (1-3) (1988)
Khee Meng Koh, K. S. Poh
Products of graphs with their closed-set lattices. Discret. Math. 69 (3) (1988)
Khee Meng Koh, K. S. Poh
On the uniformity of the closed-set lattice of a tree. Discret. Math. 61 (1) (1986)
Khee Meng Koh, K. S. Poh
On a construction of critical graphs which are not sensitive. Graphs Comb. 1 (1) (1985)
C. C. Chen, Khee Meng Koh, S. C. Lee
On the grading numbers of direct products of chains. Discret. Math. 49 (1) (1984)
Khee Meng Koh, D. G. Rogers, T. Tan
Products of graceful trees. Discret. Math. 31 (3) (1980)
Charles Delorme, Maryvonne Mahéo, Henri Thuillier, Khee Meng Koh, H. K. Teo
Cycles with a chord are graceful. J. Graph Theory 4 (4) (1980)
Khee Meng Koh, T. Tan, D. G. Rogers
Two theorems on graceful trees. Discret. Math. 25 (2) (1979)
C. C. Chen, Khee Meng Koh
A characterization of finite distributive planar lattices. Discret. Math. 5 (3) (1973)