|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 39 van 79 gevonden artikelen
| Titel: |
Independent set dominating sets in bipartite graphs |
| Auteur: |
Bohdan Zelinka |
| Verschenen in: |
Opuscula mathematica |
| Paginering: | Jaargang 25 (2005) nr. 2 pagina's 345-349 |
| Jaar: |
2005 |
| Inhoud: |
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 \subseteq D$ such that the subgraph $$ of $G$ induced by $X \cup Y$ is connected. The minimum number of vertices of an sd-set in $G$ is called the set domination number $\gamma_s(G)$ of $G$. An sd-set $D$ in $G$ such that $|D|=\gamma_s(G)$ is called a $\gamma_s$-set in $G$. In this paper we study sd-sets in bipartite graphs which are simultaneously independent. We apply the theory of hypergraphs. |
| Uitgever: |
AGH University of Science and Technology (provided by DOAJ) |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 39 van 79 gevonden artikelen
| << vorige | volgende >> |