- Tytuł:
- The well-covered dimension of products of graphs
- Autorzy:
-
Birnbaum, Isaac
Kuneli, Megan
McDonald, Robyn
Urabe, Katherine
Vega, Oscar - Powiązania:
- https://bibliotekanauki.pl/articles/30148720.pdf
- Data publikacji:
- 2014-11-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
well-covered dimension
maximal independent sets - Opis:
- We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of $K_n × G$ is found, provided that $G$ has a largest greedy independent decomposition of length $c < n$. Formulae to find the well-covered dimension of graphs obtained by vertex blowups on a known graph, and to the lexicographic product of two known graphs are also given.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2014, 34, 4; 811-827
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł