Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

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

Digraphs with isomorphic underlying and domination graphs: connected $UG^c(d)$

100%

Factor K., Langley L.

Discussiones Mathematicae Graph Theory

2007

tom 27

nr 1

51-67

The domination graph of a directed graph has an edge between vertices x and y provided either (x,z) or (y,z) is an arc for every vertex z distinct from x and y. We consider directed graphs D for which the domination graph of D is isomorphic to the underlying graph of D. We demonstrate that the complement of the underlying graph must have k connected components isomorphic to complete graphs, paths, or cycles. A complete characterization of directed graphs where k = 1 is presented.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Factor K.

1 Langley L.

1 2007

Wyniki wyszukiwania

Digraphs with isomorphic underlying and domination graphs: connected $UG^c(d)$