Independent set dominating sets in bipartite graphs
The paper continues the study of independent set dominating sets in graphs which was started by E. Sampathkumar. A subset \(D\) of the vertex set \(V(G)\) of a graph \(G\) is called a set dominating set (shortly sd-set) in \(G\), if for each set \(X \subseteq V(G)-D\) there exists a set \(Y \subsete...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2005-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol25/2/art/opuscula_math_2525.pdf |