Abstract
This paper investigates realizations of a given degree sequence, and the way in which they are related by switchings. The results are given in the context of simple graphs, multigraphs and pseudographs. We show that we can transform any connected graph to any other connected graph of the same degree sequence, by switchings wich are constrained to connected graphs. This is done for certain labelled graphs, the result for unlabelled graphs following as a corollary. The results are then extended to infinite degree sequences.
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
D. Billington, Private Communication.
C.J. Colbourn, Graph enumeration, Dept. of Computer Science, University of Waterloo, Research Report CS-77-37 (1977).
R.B. Eggleton, Graphic sequences and graphic polynomials: a report, in Infinite and Finite Sets, Vol. 1, ed. A. Hajnal et al, Colloq. Math. Soc. J. Bolyai 10, (North Holland, Amsterdam, 1975) 385–392.
R.B. Eggleton and D.A. Holton, Path realizations of multigraphs, I. The disconnected case, Dept. of Mathematics, University of Melbourne, Research Report 33 (1978).
R.B. Eggleton and D.A. Holton, Graphic sequences Comb. Maths. VI, Proc. Sixth Aust. Conf., Lecture Notes in Maths. 748 (Springer-Verlag, 1979) 1–10.
R.B. Eggleton and D.A. Holton, The graph of type (0, ∞, ∞) realizations of a graphic sequence, Comb. Math. VI, Proc. Sixth Aust. Conf., Lecture Notes in Maths. 748 (Springer-Verlag, 1979) 40–54.
R.B. Eggleton and D.A. Holton, Pseudographic realizations of an infinitary degree sequence, Comb. Math. VII, Proc. Seventh Aust. Conf., Lecture Notes in Maths. 829 (Springer-Verlag, 1980), 94–109.
R.B. Eggleton and D.A. Holton, Simple and multigraphic realizations of degree sequences, this volume.
S.L. Hakimi, On realizability of a set of integers as degrees of the vertices of a linear graph I, J. Soc. Indust. Appl. Math. 10 (1962) 492–506.
S.L. Hakimi, On realizability of a set of integers as degrees of the vertices of a linear graph II, uniqueness, J. Soc. Indust. Appl. Math. 11 (1963) 135–147.
M.M. Syslo, Private Communication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Taylor, R. (1981). Contrained switchings in graphs. In: McAvaney, K.L. (eds) Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091828
Download citation
DOI: https://doi.org/10.1007/BFb0091828
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10883-2
Online ISBN: 978-3-540-38792-3
eBook Packages: Springer Book Archive