Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: 2-packing, Cartesian product

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

On dominating the Cartesian product of a graph and K₂

100%

Hartnell B., Rall D.

Discussiones Mathematicae Graph Theory

2004

tom 24

nr 3

389-402

In this paper we consider the Cartesian product of an arbitrary graph and a complete graph of order two. Although an upper and lower bound for the domination number of this product follow easily from known results, we are interested in the graphs that actually attain these bounds. In each case, we provide an infinite class of graphs to show that the bound is sharp. The graphs that achieve the lower bound are of particular interest given the special nature of their dominating sets and are investigated further.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Hartnell B.

1 Rall D.

1 2004

Wyniki wyszukiwania

On dominating the Cartesian product of a graph and K₂