Abstract
In this paper we characterize all finite sequences of ordered pairs of non-negative integers which form the outdegree-indegree sequence of (a) a self-complementary digraph and (b) a self-converse digraph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W.K. Chen, Applied Graph Theory, North-Holland Publishing Company, Amsterdam, London, 1971.
C.R.J. Clapham, Potentially self-complementary degree sequences, J. Combinatorial Theory, Ser. B, 20 (1976), 75–79.
C.R.J. Clapham and D.J. Kleitman, The degree sequences of self-complementary graphs, J. of Combinatorial Theory, Ser. B, 20 (1976), 67–74.
W.J.R. Eplett, Self-converse tournaments, Canadian Math. Bull., Vol. 22, No. 1 (1979), 23–27.
D.R. Fulkerson, Zero-one matrices with zero trace, Pacific J. Math., 10 (1960), 831–836.
F. Harary, Graph Theory, Addison Wesley, New York, 1969.
D.J. Kleitman and D.L. Wang, Algorithms for constructing graphs and digraphs with given valences and factors, Discrete Math., 6 (1973), 79–88.
S.B. Rao, Characterization of forcibly self-complementary degree sequences, Submitted for publication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Das, P. (1981). Characterization of potentially self-complementary, self-converse degree-pair sequences for digraphs. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092265
Download citation
DOI: https://doi.org/10.1007/BFb0092265
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11151-1
Online ISBN: 978-3-540-47037-3
eBook Packages: Springer Book Archive