Geodesic
Regular Digraphs Containing a Given Digraph
Canadian mathematical bulletin, Tome 27 (1984) no. 2, pp. 129-133

Voir la notice de l'article provenant de la source Cambridge

DOI

Let the maximum degree d of a digraph D be the maximum of the set of all outdegrees and indegrees of the points of D. We prove that every digraph D of order P and maximum degree d has a d-regular superdigraph H with at most d + 1 more points, and that this bound, which is independent of p, is best possible.
DOI : 10.4153/CMB-1984-020-0
Mots-clés : 05C20 
Harary, Frank; Karabed, Razmik. Regular Digraphs Containing a Given Digraph. Canadian mathematical bulletin, Tome 27 (1984) no. 2, pp. 129-133. doi: 10.4153/CMB-1984-020-0
@article{10_4153_CMB_1984_020_0,
     author = {Harary, Frank and Karabed, Razmik},
     title = {Regular {Digraphs} {Containing} a {Given} {Digraph}},
     journal = {Canadian mathematical bulletin},
     pages = {129--133},
     year = {1984},
     volume = {27},
     number = {2},
     doi = {10.4153/CMB-1984-020-0},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1984-020-0/}
}
TY  - JOUR
AU  - Harary, Frank
AU  - Karabed, Razmik
TI  - Regular Digraphs Containing a Given Digraph
JO  - Canadian mathematical bulletin
PY  - 1984
SP  - 129
EP  - 133
VL  - 27
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1984-020-0/
DO  - 10.4153/CMB-1984-020-0
ID  - 10_4153_CMB_1984_020_0
ER  - 
%0 Journal Article
%A Harary, Frank
%A Karabed, Razmik
%T Regular Digraphs Containing a Given Digraph
%J Canadian mathematical bulletin
%D 1984
%P 129-133
%V 27
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1984-020-0/
%R 10.4153/CMB-1984-020-0
%F 10_4153_CMB_1984_020_0

Cité par Sources :