Clique-transversal sets in 4-regular claw-free graphs |
| |
Authors: | Er Fang Shan Li Ying Kang |
| |
Affiliation: | Department of Mathematics, Shanghai University, Shanghai 200444, P. R. China |
| |
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 by τ c (G), is the minimum cardinality of a clique-transversal set in G. In this paper we give the exact value of the clique-transversal number for the line graph of a complete graph. Also, we give a lower bound on the clique-transversal number for 4-regular claw-free graphs and characterize the extremal graphs achieving the lower bound. |
| |
Keywords: | Clique-transversal set claw-free graph line graph regular graph |
本文献已被 维普 SpringerLink 等数据库收录! |