IJPAM: Volume 91, No. 1 (2014)
Research and Development Centre
Coimbatore, 641046, Tamilnadu, INDIA
Ramanujan Research Centre in Mathematics
Saraswathi Narayanan College
Madurai-625018, Tamilnadu, INDIA
Abstract. Let be a simple graph. A subset of is called a clique transversal set of if intersects every clique of . (That is every maximal complete subgraph of ). The minimum cardinality of a clique transversal set of is called the clique traversal number of and is denoted by . Any clique transversal set of is a dominating set of . Also . In this paper we characterize trees those and for which . We also prove that if and only if is a wounded spider.
Received: October 24, 2013
AMS Subject Classification: 05C69
Key Words and Phrases: clique transversal sets, clique transversal number
Download paper from here.
DOI: 10.12732/ijpam.v91i1.5 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395