Line domination in graphs (Q1092932)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Line domination in graphs |
scientific article; zbMATH DE number 4021196
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Line domination in graphs |
scientific article; zbMATH DE number 4021196 |
Statements
Line domination in graphs (English)
0 references
1987
0 references
The line domination number of a graph is the minimum number of edges with the property that every other edge is adjacent to some of these edges. Several results, especially bounds, on this number are presented.
0 references
edge-edge domination
0 references
line domination number
0 references
