Weighted efficient domination problem on some perfect graphs (Q1348388)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1742055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weighted efficient domination problem on some perfect graphs |
scientific article; zbMATH DE number 1742055 |
Statements
Weighted efficient domination problem on some perfect graphs (English)
0 references
15 May 2002
0 references
A subset \(D\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(D\). If moreover the distance between arbitrary two vertices of \(D\) is at least 3, then \(D\) is called an efficient dominating set in \(G\). Not in every graph \(G\) an efficient dominating set exists. The paper is devoted to algorithmic problems concerning its existence. In particular, it pays attention to bipartite graphs.
0 references
efficient dominating set
0 references
bipartite graphs
0 references
0 references
0 references
0 references
0 references
0.8460323214530945
0 references
0.8352929949760437
0 references
0.8317645192146301
0 references
0.8307145833969116
0 references
