Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-25T18:55:49.840Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Swap-Distances of Different Realizations of a Graphical Degree Sequence

Published online by Cambridge University Press:  05 April 2013

PÉTER L. ERDŐS ,
ZOLTÁN KIRÁLY  and
ISTVÁN MIKLÓS
PÉTER L. ERDŐS
Affiliation:
Alfréd Rényi Institute, Reáltanoda u 13-15 Budapest, 1053Hungary (e-mail: [email protected], [email protected])
ZOLTÁN KIRÁLY
Affiliation:
Department of Computer Science and EGRES (MTA-ELTE), Eötvös University, Pázmány Péter sétány 1/C, Budapest, 1117Hungary (e-mail: [email protected])
ISTVÁN MIKLÓS
Affiliation:
Alfréd Rényi Institute, Reáltanoda u 13-15 Budapest, 1053Hungary (e-mail: [email protected], [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

One of the first graph-theoretical problems to be given serious attention (in the 1950s) was the decision whether a given integer sequence is equal to the degree sequence of a simple graph (or graphical, for short). One method to solve this problem is the greedy algorithm of Havel and Hakimi, which is based on the swap operation. Another, closely related question is to find a sequence of swap operations to transform one graphical realization into another of the same degree sequence. This latter problem has received particular attention in the context of rapidly mixing Markov chain approaches to uniform sampling of all possible realizations of a given degree sequence. (This becomes a matter of interest in the context of the study of large social networks, for example.) Previously there were only crude upper bounds on the shortest possible length of such swap sequences between two realizations. In this paper we develop formulae (Gallai-type identities) for the swap-distances of any two realizations of simple undirected or directed degree sequences. These identities considerably improve the known upper bounds on the swap-distances.

Keywords

Primary 05C07Secondary 05C2005C45
Type
Paper
Information
Combinatorics, Probability and Computing , Volume 22 , Issue 3 , May 2013 , pp. 366 - 383
Copyright
Copyright © Cambridge University Press 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Berger, A. and Müller-Hannemann, M. (2010) Uniform sampling of digraphs with a fixed degree sequence. In Graph Theoretic Concepts in Computer Science, Vol. 6410 of Lecture Notes in Computer Science, Springer, pp. 220–231.CrossRefGoogle Scholar
[2]Bereg, S. and Ito, H. (2008) Transforming graphs with the same degree sequence. In KyotoCGGT 2007, LNCS 4535 (H. Ito et al., eds), pp. 25–32.Google Scholar
[3]Erdős, P. and Gallai, T. (1960) Graphs with prescribed degree of vertices (in Hungarian). Mat. Lapok 11 264–274.Google Scholar
[4]Erdős, P. L., Miklós, I. and Toroczkai, Z. (2010) A simple Havel–Hakimi type algorithm to realize graphical degree sequences of directed graphs. Electron. J. Combin. 17 #R66.Google Scholar
[5]Fulkerson, D. R. (1960) Zero-one matrices with zero trace. Pacific J. Math. 10 831–836.CrossRefGoogle Scholar
[6]Gale, D. (1957) A theorem on flows in networks, Pacific J. Math. 7 1073–1082.Google Scholar
[7]Greenhill, C. (2011) A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs. Electron. J. Combin. 18 #P234.Google Scholar
[8]Hakimi, S. L. (1962) On the realizability of a set of integers as degrees of the vertices of a simple graph. SIAM J. Appl. Math. 10 496–506.Google Scholar
[9]Hakimi, S. L. (1965) On the degrees of the vertices of a directed graph. J. Franklin Institute 279 290–308.Google Scholar
[10]Havel, V. (1955) A remark on the existence of finite graphs (in Czech). Časopis Pěst. Mat. 80 477–480.Google Scholar
[11]Kim, H., Toroczkai, Z., Erdős, P. L., Miklós, I. and Székely, L. A. (2009) Degree-based graph construction. J. Phys. A: Math. Theor. 42 392001.Google Scholar
[12]Király, Z. (2012) Recognizing graphic degree sequences and generating all realizations. EGRES Technical Report TR-2011-11. http://www.cs.elte.hu/egresGoogle Scholar
[13]Kleitman, D. J. and Wang, D. L. (1973) Algorithms for constructing graphs and digraphs with given valences and factors. Discrete Math. 6 79–88.Google Scholar
[14]Kundu, S. (1973) The k-factor conjecture is true. Discrete Math. 6 367–376.Google Scholar
[15]LaMar, M. D. (2011) Directed 3-cycle anchored digraphs and their application in the uniform sampling of realizations from a fixed degree sequence. In ACM & IEEE & SCS Proc. 2011 Winter Simulation Conference (Jain, S., Creasey, R. R.et al., eds), pp. 1–12.Google Scholar
[16]Petersen, J. (1891) Die Theorie der regulären Graphen. Acta Math. 15 193–220.Google Scholar
[17]Ryser, H. J. (1957) Combinatorial properties of matrices of zeros and ones. Canad. J. Math. 9 371–377.CrossRefGoogle Scholar
[18]Senior, J. K. (1951) Partitions and their representative graphs. Amer. J. Math. 73 663–689.Google Scholar
[19]Tutte, W. T. (1952) The factors of graphs. Canad. J. Math. 4 314–328.Google Scholar
[20]Tutte, W. T. (1954) A short proof of the factors theorem for finite graphs. Canad. J. Math. 6 347–352.Google Scholar
[21]West, D. B. (2001) Introduction to Graph Theory, second edition, Prentice Hall.Google Scholar