Degree sequences of digraphs with highly irregular property

• Autorzy: Zofia Majcher , Jerzy Michael
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

digraph; degree sequence; highly irregular property

Kategorie tematyczne

• 05C20: Directed graphs (digraphs), tournaments

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 1998
• Tom: 18
• Numer: 1
• Strony: 49-61

Daty

wydano

1998

otrzymano

1997-01-02

Twórcy

autor

Zofia Majcher

• Institute of Mathematics, University of Opole, ul. Oleska 48, 45-052 Opole, Poland

autor

Jerzy Michael

• Institute of Mathematics, University of Opole, ul. Oleska 48, 45-052 Opole, Poland

Bibliografia

• [1] Y. Alavi, J. Liu, J. Wang, Highly irregular digraphs, Discrete Math. 111 (1993) 3-10, doi: 10.1016/0012-365X(93)90134-F.
• [2] A.J. Hoffman, Some recent applications of the theory of linear inequalities to extremal combinatorial analysis, Proc. Symp. Appl. Math. 10 (1960) 317-327.
• [3] Z. Majcher, Matrices representable by directed graphs, Archivum Mathematicum (Brno) 21 (4) (1985) 205-218.
• [4] Z. Majcher, J. Michael, Degree sequences of highly irregular graphs, Discrete Math. 164 (1997) 225-236, doi: 10.1016/S0012-365X(97)84782-6.

Identyfikatory

DOI

10.7151/dmgt.1062