Eng Guan Tay

Dr. Eng Guan Tay


Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 November 2012 in Australasian Journal of Educational Technology
Verified
Journal Article
Open access
PDF file
AYAlexander Seeshing Yeung
Alexander Seeshing Yeung
KLKam Ming Lim
Kam Ming Lim
ETEng Guan Tay
Eng Guan Tay
ALAudrey Cheausim Lam-Chiang
Audrey Cheausim Lam-Chiang
CHChenri Hui
Chenri Hui
Teachers today are expected to be able to apply a wide range of digital technologies in the classroom. Initial teacher education programs should prepare teachers to apply them with confidence. Pre-service teachers in Singapore responded to a survey on use of technologies in their personal lives and in their teaching, and how confident they were in using them. Among 17 applications, the most frequently used were those related to computer technology such as checking an online dictionary, web browsing and searching, emailing, and using computer software. Participants’ use of computer software was frequent; however it was more so in their personal lives than in their teaching. The least used items included audio recording, video recording and global positioning system (GPS). Usage was found to be positively correlated with confidence, and while participants often had confidence in using the applications, their confidence was relatively low for items such as video and audio recording which the yused the least. While teachers’ use of computers is important, their ability and confidence to use other modern technologies for effective teaching should not be neglected.

31 July 2011 in ZDM – Mathematics Education
Verified
Journal Article
Closed access
PDF file
YLYew Hoong Leong
Yew Hoong Leong
JDJaguthsing Dindyal
Jaguthsing Dindyal
TTTin Lam Toh
Tin Lam Toh
KQKhiok Seng Quek
Khiok Seng Quek
ETEng Guan Tay
Eng Guan Tay
SLSieu Tee Lou
Sieu Tee Lou

5 January 2010 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
XJXian'AN Jin
Xian'AN Jin
FZFuji Zhang
Fuji Zhang
FDFengming Dong
Fengming Dong
ETEng Guan Tay
Eng Guan Tay
In this paper, we present a formula for computing the Tutte polynomial of the signed graph formed from a labeled graph by edge replacements in terms of the chain polynomial of the labeled graph. Then we define a family of 'ring of tangles' links and consider zeros of their Jones polynomials. By applying the formula obtained, Beraha-Kahane-Weiss's theorem and Sokal's lemma, we prove that zeros of Jones polynomials of (pretzel) links are dense in the whole complex plane.

25 November 2020 in Educational Studies in Mathematics
Verified
Journal Article
Closed access
PDF file
DTDa Yang Tan
Da Yang Tan
ETEng Guan Tay
Eng Guan Tay
KTKok Ming Teo
Kok Ming Teo
PSPaul M. E. Shutler
Paul M. E. Shutler

1 December 2017 in International Journal of Science and Mathematics Education
Verified
Journal Article
Closed access
PDF file
YLYew Hoong Leong
Yew Hoong Leong
ETEng Guan Tay
Eng Guan Tay
TTTin Lam Toh
Tin Lam Toh
KQKhiok Seng Quek
Khiok Seng Quek
RYRomina Ann Soon Yap
Romina Ann Soon Yap

7 January 2001 in BRICS Report Series
Verified
Journal Article
Open access
PDF file
GGGregory Gutin
Gregory Gutin
KKKhee Meng Koh
Khee Meng Koh
ETEng Guan Tay
Eng Guan Tay
AYAnders Yeo
Anders Yeo
A vertex set X of a digraph D = (V,A) is a kernel if X is independent (i.e., all pairs of distinct vertices of X are non-adjacent) and forevery v in V − X there exists x in X such that vx in A. A vertex setX of a digraph D = (V,A) is a quasi-kernel if X is independent andfor every v in V − X there exist w in V − X, x in X such that eithervx in A or vw,wx in A: In 1994, Chvatal and Lovasz proved that everydigraph has a quasi-kernel. In 1996, Jacob and Meyniel proved that, if a digraph D has no kernel, then D contains at least three quasi-kernels.We characterize digraphs with exactly one and two quasi-kernels, and,thus, provide necessary and sufficient conditions for a digraph to haveat least three quasi-kernels. In particular, we prove that every strongdigraph of order at least three, which is not a 4-cycle, has at leastthree quasi-kernels. We conjecture that every digraph with no sinkhas a pair of disjoint quasi-kernels and provide some support to thisconjecture.