Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-26T00:10:04.090Z Has data issue: false hasContentIssue false
  • English
  • Français

Regular Digraphs Containing a Given Digraph

Published online by Cambridge University Press:  20 November 2018

Frank Harary  and
Razmik Karabed
Frank Harary
Affiliation:
University of MichiganAnn Arbor, MI 48109, U.S.A.
Razmik Karabed
Affiliation:
University of MichiganAnn Arbor, MI 48109, U.S.A.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Keywords

05C20
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 27 , Issue 2 , 01 June 1984 , pp. 129 - 133
Copyright
Copyright © Canadian Mathematical Society 1984

References

1. Akiyama, J., Era, H. and Harary, F., Regular graphs containing a given graph. Elem. Math. 38 (1982), 15–17.Google Scholar
2. Beineke, L. W. and Pippert, R. E., Minimal regular extensions of oriented graphs. Amer. Math. Monthly 76 (1969) 145–151.Google Scholar
3. Erdös, P. and Kelly, P. J., The minimal regular graph containing a given graph. Amer. Math. Monthly 70 (1963) 1074–1075.Google Scholar
4. Erdös, P. and Kelly, P. J., The minimal regular graph containing a given graph. A Seminar on Graph Theory (F. Harary, ed.), Holt, New York (1967) 65–69.Google Scholar
5. Harary, F., Graph Theory. Addison-Wesley, Reading, (1969).Google Scholar
6. König, D., Théorie der endlichen und unendlichen Graohen. Leipzig (1936), Reprinted, Chelsea, New York (1950).Google Scholar