Weighted Maximum-Clique Transversal Sets of Graphs | Zendy

Chuan-Min Lee | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Weighted Maximum-Clique Transversal Sets of Graphs

Author(s) -

Chuan-Min Lee

Publication year - 2011

Publication title -

isrn discrete mathematics

Language(s) - English

Resource type - Journals

ISSN - 2090-7788

DOI - 10.5402/2011/540834

Subject(s) - treewidth , transversal (combinatorics) , combinatorics , cardinality (data modeling) , chordal graph , clique , mathematics , split graph , clique problem , clique sum , algorithm , discrete mathematics , graph , pathwidth , computer science , 1 planar graph , database , line graph , mathematical analysis

A maximum-clique transversal set of a graph is a subset of vertices intersecting all maximum cliques of . The maximum-clique transversal set problem is to find a maximum-clique transversal set of of minimum cardinality. Motivated by the placement of transmitters for cellular telephones, Chang, Kloks, and Lee introduced the concept of maximum-clique transversal sets on graphs in 2001. In this paper, we study the weighted version of the maximum-clique transversal set problem for split graphs, balanced graphs, strongly chordal graph, Helly circular-arc graphs, comparability graphs, distance-hereditary graphs, and graphs of bounded treewidth.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research