ArticleOriginal scientific text
Title
Degree sequences of digraphs with highly irregular property
Authors 1, 1
Affiliations
- Institute of Mathematics, University of Opole
Abstract
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.
Keywords
digraph, degree sequence, highly irregular property
Bibliography
- Y. Alavi, J. Liu, J. Wang, Highly irregular digraphs, Discrete Math. 111 (1993) 3-10, doi: 10.1016/0012-365X(93)90134-F.
- A.J. Hoffman, Some recent applications of the theory of linear inequalities to extremal combinatorial analysis, Proc. Symp. Appl. Math. 10 (1960) 317-327.
- Z. Majcher, Matrices representable by directed graphs, Archivum Mathematicum (Brno) 21 (4) (1985) 205-218.
- Z. Majcher, J. Michael, Degree sequences of highly irregular graphs, Discrete Math. 164 (1997) 225-236, doi: 10.1016/S0012-365X(97)84782-6.
Pages:
49-61
Main language of publication
English
Received
1997-01-02
Published
1998
Exact and natural sciences