#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2004

2013

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hua-ming Xing, Liang Sun, Xue-Gang Chen
- Graphs and Combinatorics
- 2006

- Hua-ming Xing, Xin Chen, Xue-Gang Chen
- Discrete Mathematics
- 2006

- Hua-ming Xing, Liang Sun, Xue-Gang Chen
- Ars Comb.
- 2005

- Xue-Gang Chen, Liang Sun, Hua-ming Xing
- Discrete Mathematics
- 2004

Let G = (V, E) be a graph. A function f : V → {−1,+1} defined on the vertices of G is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. The signed total domination number of G, γ t (G), is the minimum weight of a signed total dominating function of G. In this paper, we study the signed total… (More)

- Hua-ming Xing, Liang Su
- Ars Comb.
- 2005

- Hua-ming Xing, Johannes H. Hattingh, Andrew R. Plummer
- Appl. Math. Lett.
- 2008

Let G = (V,E) be a simple graph. A set D ⊆ V is a dominating set of G if every vertex of V − D is adjacent to a vertex of D. The domination number of G, denoted by γ(G), is the minimum cardinality of a dominating set of G. We prove that if G is a Hamiltonian graph of order n with minimum degree at least six, then γ(G) ≤ 6n 17 .

- ‹
- 1
- ›