Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: maximal independent sets.

Sortuj według:

Ogranicz wyniki do:

The Well-Covered Dimension Of Products Of Graphs

100%

Birnbaum I., Kuneli M., McDonald R., Urabe K., Vega O.

Discussiones Mathematicae Graph Theory

2014

tom 34

nr 4

811-827

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 Kn × 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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Birnbaum I.

1 Kuneli M.

1 McDonald R.

1 Urabe K.

1 Vega O.

1 2014

Wyniki wyszukiwania

The Well-Covered Dimension Of Products Of Graphs