Bounds on the clique-transversal number of regular graphs
基本信息来源于合作网站,原文需代理用户跳转至来源网站获取
摘要:
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 Tc(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.