Abstract
Let G and H be two graphs with the same vertex set V. It is well known that a graph G can be transformed into a graph H by a sequence of 2-switches if and only if every vertex of V has the same degree in both G and H. We study the problem of finding the minimum number of 2-switches for transforming G into H.
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
Berge, C.: Graphes et hypergraphes, Monographies Universitaires de Mathématiques, vol. 37. Dunod, Paris (1970)
Erdős, P., Gallai, T.: Graphs with prescribed degrees of vertices. Mat. Lapok 11, 264–274 (1960)
Hakimi, S.L.: On the realizability of a set of integers as degrees of the vertices of a graph. SIAM Journal on Applied Mathematics 10, 496–506 (1962)
Havel, V.: A remark on the existence of finite graphs. Časopis pro Pěstováni Matematiky 80, 477–480 (1955) [Czech]
West, D.: An Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bereg, S., Ito, H. (2008). Transforming Graphs with the Same Degree Sequence. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds) Computational Geometry and Graph Theory. KyotoCGGT 2007. Lecture Notes in Computer Science, vol 4535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89550-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-89550-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89549-7
Online ISBN: 978-3-540-89550-3
eBook Packages: Computer ScienceComputer Science (R0)