#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1997

2017

- This year (1)
- Last 5 years (2)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

- 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.

- K. M. Koh, Eng Guan Tay
- Discrete Mathematics
- 1998

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

- K. M. Koh, Eng Guan Tay
- Graphs and Combinatorics
- 2002

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

- 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
- Networks
- 1998

- 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)