Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: prism doubler

Sortuj według:

Ogranicz wyniki do:

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

Characterizing Cartesian fixers and multipliers

100%

Benecke S., Mynhardt C.

Discussiones Mathematicae Graph Theory

2012

tom 32

nr 1

161-175

Let G ☐ H denote the Cartesian product of the graphs G and H. In 2004, Hartnell and Rall [On dominating the Cartesian product of a graph and K₂, Discuss. Math. Graph Theory 24(3) (2004), 389-402] characterized prism fixers, i.e., graphs G for which γ(G ☐ K₂) = γ(G), and noted that γ(G ☐ Kₙ) ≥ min{|V(G)|, γ(G)+n-2}. We call a graph G a consistent fixer if γ(G ☐ Kₙ) = γ(G)+n-2 for each n such that 2 ≤ n < |V(G)|- γ(G)+2, and characterize this class of graphs. Also in 2004, Burger, Mynhardt and Weakley [On the domination number of prisms of graphs, Dicuss. Math. Graph Theory 24(2) (2004), 303-318] characterized prism doublers, i.e., graphs G for which γ(G ☐ K₂) = 2γ(G). In general γ(G ☐ Kₙ) ≤ nγ(G) for any n ≥ 2. We call a graph attaining equality in this bound a Cartesian n-multiplier and also characterize this class of graphs.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Benecke S.

1 Mynhardt C.

1 2012

Wyniki wyszukiwania

Characterizing Cartesian fixers and multipliers