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.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1062,
author = {Zofia Majcher and Jerzy Michael},
title = {Degree sequences of digraphs with highly irregular property},
journal = {Discussiones Mathematicae Graph Theory},
volume = {18},
year = {1998},
pages = {49-61},
zbl = {0915.05063},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1062}
}
Zofia Majcher; Jerzy Michael. Degree sequences of digraphs with highly irregular property. Discussiones Mathematicae Graph Theory, Tome 18 (1998) pp. 49-61. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1062/
[000] [1] Y. Alavi, J. Liu, J. Wang, Highly irregular digraphs, Discrete Math. 111 (1993) 3-10, doi: 10.1016/0012-365X(93)90134-F. | Zbl 0786.05038
[001] [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.
[002] [3] Z. Majcher, Matrices representable by directed graphs, Archivum Mathematicum (Brno) 21 (4) (1985) 205-218. | Zbl 0615.05043
[003] [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. | Zbl 0870.05071