Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: generalized prisms

Sortuj według:

Ogranicz wyniki do:

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

Domination in functigraphs

100%

Eroh L., Gera R., Kang C., Larson C., Yi E.

Discussiones Mathematicae Graph Theory

2012

tom 32

nr 2

299-319

Let G₁ and G₂ be disjoint copies of a graph G, and let f:V(G₁) → V(G₂) be a function. Then a functigraph C(G,f) = (V,E) has the vertex set V = V(G₁) ∪ V(G₂) and the edge set E = E(G₁) ∪ E(G₂) ∪ {uv | u ∈ V(G₁), v ∈ V(G₂),v = f(u)}. A functigraph is a generalization of a permutation graph (also known as a generalized prism) in the sense of Chartrand and Harary. In this paper, we study domination in functigraphs. Let γ(G) denote the domination number of G. It is readily seen that γ(G) ≤ γ(C(G,f)) ≤ 2 γ(G). We investigate for graphs generally, and for cycles in great detail, the functions which achieve the upper and lower bounds, as well as the realization of the intermediate values.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Eroh L.

1 Gera R.

1 Kang C.

1 Larson C.

1 Yi E.

1 2012

Wyniki wyszukiwania

Domination in functigraphs