- Tytuł:
- On arbitrarily vertex decomposable unicyclic graphs with dominating cycle
- Autorzy:
-
Cichacz, Sylwia
Zioło, Irmina - Powiązania:
- https://bibliotekanauki.pl/articles/743581.pdf
- Data publikacji:
- 2006
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
arbitrarily vertex decomposable graph
dominating cycle - Opis:
- A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n₁,...,nₖ) of positive integers such that $∑^k_{i=1} n_i = n$, there exists a partition (V₁,...,Vₖ) of vertex set of G such that for every i ∈ {1,...,k} the set $V_i$ induces a connected subgraph of G on $n_i$ vertices. We consider arbitrarily vertex decomposable unicyclic graphs with dominating cycle. We also characterize all such graphs with at most four hanging vertices such that exactly two of them have a common neighbour.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2006, 26, 3; 403-412
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł