Satgraphs and independent domination. Part 1

https://doi.org/10.1016/j.tcs.2005.08.038Get rights and content
Under an Elsevier user license
open archive

Abstract

A graph G is called a satgraph if there exists a partition AB=V(G) such that

  • A induces a clique [possibly, A=],

  • B induces a matching [i.e., G(B) is a 1-regular subgraph, possibly, B=], and

  • there are no triangles (a,b,b), where aA and b,bB.

We also introduce the hereditary closure of SAT, denoted by HSAT [hereditary satgraphs]. The class HSAT contains split graphs. In turn, HSAT is contained in the class of all (1,2)-split graphs [A. Gyárfás, Generalized split graphs and Ramsey numbers, J. Combin. Theory Ser. A 81 (2) (1998) 255–261], the latter being still not characterized. We characterize satgraphs in terms of forbidden induced subgraphs.

There exist close connections between satgraphs and the satisfiability problem [SAT]. In fact, SAT is linear-time equivalent to finding the independent domination number in the corresponding satgraph. It follows that the independent domination problem is NP-complete for the hereditary satgraphs. In particular, it is NP-complete for perfect graphs.

MSC

68Q17
68R10
05C69
05C85

Keywords

Satgraphs
Satisfiability problem
Hereditary class of graphs
Forbidden induced subgraph characterization
Independent domination problem
Polar graphs
Perfect graphs
NP-complete
Polynomial-time algorithm

Cited by (0)