#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1981

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Chong-Keang Lim, Yee-Hock Peng
- Journal of Graph Theory
- 1981

- Saieed Akbari, Saeid Alikhanib, Yee-hock Peng
- 2009

Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G, x) = n i=γ(G) d(G, i)x i , where d(G, i) is the number of dominating sets of G of size i, and γ(G) is the domination number of G. In this paper we study the domination polynomials of cubic graphs of order 10. As a consequence, we show that the Petersen graph is… (More)

- Saieed Akbari, Saeid Alikhani, Yee-Hock Peng
- Eur. J. Comb.
- 2010

- Shaoji Xu, Jinjie Liu, Yee-Hock Peng
- Discrete Mathematics
- 1994

The graph consisting of s paths joining two vertices is called an s-bridge graph. In this paper, we discuss the chromaticity of some families of s-bridge graphs, especially 4-bridge graphs, and some graphs related to s-bridge graphs. 1. The chromaticity of 4-bridge graphs The graphs considered here are finite, undirected, simple and loopless. For a graph G,… (More)

- Saeid Alikhani, Yee-Hock Peng
- Ars Comb.
- 2014

- Saeid Alikhani, Yee-Hock Peng
- Int. J. Math. Mathematical Sciences
- 2009

Let G V, E be a simple graph. A set S ⊆ V is a dominating set of G, if every vertex in V \S is adjacent to at least one vertex in S. Let P i n be the family of all dominating sets of a path P n with cardinality i, and let dP n , j |P j n |. In this paper, we construct P i n , and obtain a recursive formula for dP n , i. Using this recursive formula, we… (More)

- Yee-Hock Peng, Charles H. C. Little, Kee L. Teo, Hong Wang
- Discrete Mathematics
- 1997

- Yee-Hock Peng
- Graphs and Combinatorics
- 1995

- Behnaz Omoomi, Yee-Hock Peng
- Discrete Mathematics
- 2003

Let G be a simple graph of order n. number of G. In this paper we study the domination polynomials of cubic graphs of order 10. As a consequence, we show that the Petersen graph is determined uniquely by its domination polynomial.