Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

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

Degree sequences of digraphs with highly irregular property

100%

Majcher Z., Michael J.

Discussiones Mathematicae Graph Theory

1998

tom 18

nr 1

49-61

A digraph such that for each its vertex, vertices of the out-neighbourhood have different in-degrees and vertices of the in-neighbourhood have different out-degrees, will be called an HI-digraph. In this paper, we give a characterization of sequences of pairs of out- and in-degrees of HI-digraphs.

Extremum degree sets of irregular oriented graphs and pseudodigraphs

81%

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 Majcher Z.

2 Michael J.

1 Dziechcińska-Halamoda Z.

1 Skupień Z.

1 2006

1 1998

Wyniki wyszukiwania

Degree sequences of digraphs with highly irregular property

Extremum degree sets of irregular oriented graphs and pseudodigraphs