Line domination in graphs
| ISSN: |
1435-5914
|
|---|---|
| Source: |
Springer Online Journal Archives 1860-2000
|
| Topics: |
Computer Science
Mathematics
|
| Notes: |
Abstract A setS of lines is a line dominating set if every line not inS is adjacent to some line ofS. The line domination number of a graph is the cardinality of a minimum line dominating set. In this paper we study the line dominating sets and obtain bounds for the line domination number. Also, Nordhaus-Gaddum type results are obtained for the line domination number and the line domatic number.
|
| Type of Medium: |
Electronic Resource
|
| URL: |