Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: irregular digraph

Sortuj według:

Ogranicz wyniki do:

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

A Sokoban-type game and arc deletion within irregular digraphs of all sizes

100%

Dziechcińska-Halamoda Z., Majcher Z., Majcher Z., Skupień Z.

Discussiones Mathematicae Graph Theory

2007

tom 27

nr 3

611-622

Digraphs in which ordered pairs of out- and in-degrees of vertices are mutually distinct are called irregular, see Gargano et al. [3]. Our investigations focus on the problem: what are possible sizes of irregular digraphs (oriented graphs) for a given order n? We show that those sizes in both cases make up integer intervals. The extremal sizes (the endpoints of these intervals) are found in [1,5]. In this paper we construct, with help of Sokoban-type game, n-vertex irregular oriented graphs (irregular digraphs) of all intermediate sizes.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Dziechcińska-Halamoda Z.

1 Majcher Z.

1 Skupień Z.

1 2007

Wyniki wyszukiwania

A Sokoban-type game and arc deletion within irregular digraphs of all sizes