Domination and Total domination in Wrapped Butterfly networks
| Autor: | Indra Rajasingh, V. Shalini |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Butterfly network
Computer science 020206 networking & telecommunications 02 engineering and technology Graph Vertex (geometry) Combinatorics Cardinality Dominating set Butterfly 0202 electrical engineering electronic engineering information engineering General Earth and Planetary Sciences 020201 artificial intelligence & image processing General Environmental Science |
| Zdroj: | Procedia Computer Science. 172:66-70 |
| ISSN: | 1877-0509 |
| DOI: | 10.1016/j.procs.2020.05.010 |
| Popis: | A set S of vertices in a graph G is a dominating set if every vertex of G is either in S or in adjacent to some vertex of S. If S is independent, then S is called an independent dominating set. The domination problem is to determine a dominating set of minimum cardinality. Independent domination problem is defined similarly. A Wrapped butterfly network WBF(n), n ≥ 3, is obtained by merging the first and last levels of a butterfly network BF(n), n ≥ 3. In this paper we determine upper bounds for the domination and total domination numbers of WBF(n). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|