A unified approach to domination problems on interval graphs (Q1111566): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(88)90091-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2021568739 / rank | |||
Normal rank |
Revision as of 02:38, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A unified approach to domination problems on interval graphs |
scientific article |
Statements
A unified approach to domination problems on interval graphs (English)
0 references
1988
0 references
A subset D of the vertex set V(G) of a graph G is called dominating (or total dominating) in G, if for each vertex \(x\in V(G)-D\) (or for each vertex \(x\in V(G)\) respectively) there exists a vertex \(y\in D\) adjacent to x. A dominating set of G which induces a connected subgraph of G is called connected. Also independent dominating sets are considered. The mentioned concepts are studied for interval graphs, i.e. intersection graphs of families of intervals on a real line. Some recurrence relations for various types of dominating sets in interval graphs are stated. These relations lead to linear-time algorithms for the weighted version of the various dominating problems in a unified way.
0 references
dominating set
0 references
interval graphs
0 references