- Tytuł:
- Graphs without induced P₅ and C₅
- Autorzy:
-
Bacsó, Gabor
Tuza, Zsolt - Powiązania:
- https://bibliotekanauki.pl/articles/744580.pdf
- Data publikacji:
- 2004
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
graph domination
connected domination
complete subgraph
forbidden induced subgraph
characterization - Opis:
- Zverovich [Discuss. Math. Graph Theory 23 (2003), 159-162.] has proved that the domination number and connected domination number are equal on all connected graphs without induced P₅ and C₅. Here we show (with an independent proof) that the following stronger result is also valid: Every P₅-free and C₅-free connected graph contains a minimum-size dominating set that induces a complete subgraph.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2004, 24, 3; 503-507
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł