The complexity of connected domination and total domination by restricted induced graphs
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Event
-
Veröffentlichung
- (where)
-
Köln
- (who)
-
Universitäts- und Stadtbibliothek Köln
- (when)
-
2010
- Creator
-
Schaudt, Oliver
Schrader, Rainer
- URN
-
urn:nbn:de:hbz:38-550009
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:23 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Schaudt, Oliver
- Schrader, Rainer
- Universitäts- und Stadtbibliothek Köln
Time of origin
- 2010
Other Objects (12)
The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number
Total Domination Versus Domination in Cubic Graphs
Multiple domination in graphs
Multiple domination in graphs
On domination in graphs
When the connected domination number is at most the total domination number
From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs
Connected domination in graphs and v-numbers of binomial edge ideals
On double domination in graphs
Secure Italian domination in graphs
Independent Domination Subdivision in Graphs
Total domination versus paired domination
The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number
Total Domination Versus Domination in Cubic Graphs
Multiple domination in graphs
Multiple domination in graphs
On domination in graphs
When the connected domination number is at most the total domination number
From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs
Connected domination in graphs and v-numbers of binomial edge ideals
On double domination in graphs
Secure Italian domination in graphs
Independent Domination Subdivision in Graphs
Total domination versus paired domination
The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number
Total Domination Versus Domination in Cubic Graphs
Multiple domination in graphs
Multiple domination in graphs
On domination in graphs
When the connected domination number is at most the total domination number
From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs
Connected domination in graphs and v-numbers of binomial edge ideals
On double domination in graphs
Secure Italian domination in graphs
Independent Domination Subdivision in Graphs