Temat: connected graph - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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ł

Skocz do pozycji: 2.

Tytuł:: Graph domination in distance two
Autorzy:: Bacsó, Gábor
Tálos, Attila
Tuza, Zsolt
Powiązania:: https://bibliotekanauki.pl/articles/744316.pdf
Data publikacji:: 2005
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: graph
dominating set
connected domination
distance domination
forbidden induced subgraph
Opis:: Let G = (V,E) be a graph, and k ≥ 1 an integer. A subgraph D is said to be k-dominating in G if every vertex of G-D is at distance at most k from some vertex of D. For a given class of graphs, Domₖ is the set of those graphs G in which every connected induced subgraph H has some k-dominating induced subgraph D ∈ which is also connected. In our notation, Dom coincides with Dom₁. In this paper we prove that $Dom Dom _u = Dom₂ _u$ holds for $_u$ = {all connected graphs without induced $P_u$} (u ≥ 2). (In particular, ₂ = {K₁} and ₃ = {all complete graphs}.) Some negative examples are also given.
Źródło:: Discussiones Mathematicae Graph Theory; 2005, 25, 1-2; 121-128
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja