#### Filter Results:

#### Publication Year

1997

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Khee Meng Koh, Eng Guan Tay
- Discrete Applied Mathematics
- 1997

For a graph G, let 9(G) be the family of strong orientations of G, d(G) = min{d(D) / D t 9' (G)} and p(G) = d(G)-d(G), where d(G) and d(D) are the diameters of G and D respectively. In this paper we show that p(G) = 0 if G is a Cartesian product of (I) paths, and (2) paths and cycles, which satisfy some mild conditions.

- Khee Meng Koh, Eng Guan Tay
- Discrete Mathematics
- 2000

- Khee Meng Koh, Eng Guan Tay
- Discrete Applied Mathematics
- 1999

- Khee Meng Koh, Eng Guan Tay
- Networks
- 1997

- Khee Meng Koh, Eng Guan Tay
- Networks
- 1998

- Khee Meng Koh, Eng Guan Tay
- Discrete Mathematics
- 2000

- Khee Meng Koh, Eng Guan Tay
- Graphs and Combinatorics
- 2001

- Khee Meng Koh, Eng Guan Tay
- Discrete Mathematics
- 2001

Note On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle Abstract Let G × H denote the cartesian product of the graphs G and H , and Cn the cycle of order n. We prove the conjecture of Konig et al. that for n ¿ 2, the minimum diameter of any orientation of the graph C3 × C2n+1 is n + 3.

- Xian'an Jin, Fuji Zhang, Feng Ming Dong, Eng Guan Tay
- Electr. J. Comb.
- 2010

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… (More)

- Xian'an Jin, Feng Ming Dong, Eng Guan Tay
- Discrete Applied Mathematics
- 2009

Let G be a connected plane graph, D(G) be the corresponding link diagram via medial construction, and µ(D(G)) be the number of components of the link diagram D(G). In this paper, we first provide an elementary proof that µ(D(G)) ≤ n(G) + 1, where n(G) is the nullity of G. Then we lay emphasis on the extremal graphs, i.e. the graphs with µ(D(G)) = n(G) + 1.… (More)