Wyniki wyszukiwania

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.

Extremum degree sets of irregular oriented graphs and pseudodigraphs

100%

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

Discussiones Mathematicae Graph Theory

2006

tom 26

nr 2

317-333

A digraph in which any two vertices have distinct degree pairs is called irregular. Sets of degree pairs for all irregular oriented graphs (also loopless digraphs and pseudodigraphs) with minimum and maximum size are determined. Moreover, a method of constructing corresponding irregular realizations of those sets is given.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

2 Dziechcińska-Halamoda Z.

2 Majcher Z.

2 Skupień Z.

1 Michael J.

1 2007

1 2006

Wyniki wyszukiwania

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

Extremum degree sets of irregular oriented graphs and pseudodigraphs