- Tytuł:
- Full domination in graphs
- Autorzy:
-
Brigham, Robert
Chartrand, Gary
Dutton, Ronald
Zhang, Ping - Powiązania:
- https://bibliotekanauki.pl/articles/743419.pdf
- Data publikacji:
- 2001
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
full domination
full star domination
full closed domination
full open domination - Opis:
- For each vertex v in a graph G, let there be associated a subgraph $H_v$ of G. The vertex v is said to dominate $H_v$ as well as dominate each vertex and edge of $H_v$. A set S of vertices of G is called a full dominating set if every vertex of G is dominated by some vertex of S, as is every edge of G. The minimum cardinality of a full dominating set of G is its full domination number $γ_{FH}(G)$. A full dominating set of G of cardinality $γ_{FH}(G)$ is called a $γ_{FH}$-set of G. We study three types of full domination in graphs: full star domination, where $H_v$ is the maximum star centered at v, full closed domination, where $H_v$ is the subgraph induced by the closed neighborhood of v, and full open domination, where $H_v$ is the subgraph induced by the open neighborhood of v.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2001, 21, 1; 43-62
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł