Abstract
A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G. The clique-transversal number, denoted τc(G), is the minimum cardinality of a clique-transversal set in G. In this paper we present the bounds on the clique-transversal number for regular graphs and characterize the extremal graphs achieving the lower bound. Also, we give the sharp bounds on the clique-transversal number for claw-free cubic graphs and we characterize the extremal graphs achieving the lower bound.
| Original language | English |
|---|---|
| Pages (from-to) | 851-863 |
| Number of pages | 13 |
| Journal | Science in China, Series A: Mathematics |
| Volume | 51 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 1 May 2008 |
Keywords
- Claw-free cubic graph
- Clique-transversal number
- Clique-transversal set
- Graph
- Regular graph
ASJC Scopus subject areas
- General Mathematics