Realizability of Graph Specifications: Characterizations and Algorithms

  • Amotz Bar-Noy
  • Keerti Choudhary
  • David Peleg
  • Dror RawitzEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11085)


The study of graphs and networks often involves studying various parameters of the graph vertices, capturing different aspects of the graph structure, such as the vertex degrees or the distances between the vertices. Given an n-vertex graph G and a parameter of interest f, one may associate with G a vector \(\mathcal{F}(G)=\langle f_1,\ldots ,f_n\rangle \) giving the value of f for each vertex. This vector can be thought of as the f-profile of the graph. This paper concerns the dual problem, where given an n-entry f-specification vector \(F=\langle f_1,\ldots ,f_n\rangle \), we need to decide whether it is possible to find a graph G realizing this specification, namely, whose f-profile \(\mathcal{F}(G)\) conforms to \(F\). The paper introduces the notion of graph realiziations and illustrates a number of example problems related to finding graph realiziations for given specifications.



We are grateful to Orr Fischer and Andrzej Pelc for helpful discussions and suggestions.


  1. 1.
    Aigner, M., Triesch, E.: Realizability and uniqueness in graphs. Discret. Math. 136, 3–20 (1994)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bar-Noy, A., Choudhary, K., Peleg, D., Rawitz, D.: Graph realizations for max- and min-neighborhood degree profiles. Unpublished manuscript (2018)Google Scholar
  3. 3.
    Bar-Noy, A., Peleg, D., Rawitz, D.: Vertex-weighted realizations of graphs. Unpublished manuscript (2017)Google Scholar
  4. 4.
    Blitzstein, J.K., Diaconis, P.: A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math. 6(4), 489–522 (2011)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Choudum, S.A.: A simple proof of the Erdös-Gallai theorem on graph sequences. Bull. Aust. Math. Soc. 33(1), 67–70 (1991)CrossRefGoogle Scholar
  6. 6.
    Cloteaux, B.: Fast sequential creation of random realizations of degree sequences. Internet Math. 12(3), 205–219 (2016)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Eom, Y.-H., Jo, H.-H.: Generalized friendship paradox in complex networks. CoRR arxiv: abs/1401.1458 (2014)
  8. 8.
    Erdös, P., Gallai, T.: Graphs with prescribed degrees of vertices [hungarian]. Mat. Lapok 11, 264–274 (1960)zbMATHGoogle Scholar
  9. 9.
    Feld, S.L.: Why your friends have more friends than you do. Amer. J. Soc. 96, 1464V–1477 (1991)CrossRefGoogle Scholar
  10. 10.
    Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph-I. SIAM J. Appl. Math. 10(3), 496–506 (1962)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Havel, V.: A remark on the existence of finite graphs [in Czech]. Casopis Pest. Mat. 80, 477–480 (1955)zbMATHGoogle Scholar
  12. 12.
    Kelly, P.J.: A congruence theorem for trees. Pacific J. Math. 7, 961–968 (1957)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Mihail, M., Vishnoi, N.: On generating graphs with prescribed degree sequences for complex network modeling applications. In: 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (2002)Google Scholar
  14. 14.
    Mossel, E., Ross, N.: Shotgun assembly of labeled graphs. CoRR arxiv: abs/1504.07682 (2015)
  15. 15.
    O’Neil, P.V.: Ulam’s conjecture and graph reconstructions. Amer. Math. Monthly 77, 35–43 (1970)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Sierksma, G., Hoogeveen, H.: Seven criteria for integer sequences being graphic. J. Graph Theory 15(2), 223–231 (1991)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Tripathi, A., Tyagi, H.: A simple criterion on degree sequences of graphs. Discret. Appl. Math. 156(18), 3513–3517 (2008)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Ulam, S.M.: A Collection of Mathematical Problems. Wiley, New York (1960)zbMATHGoogle Scholar
  19. 19.
    Wang, D.L., Kleitman, D.J.: On the existence of \(n\)-connected graphs with prescribed degrees (\(n>2\)). Networks 3, 225–239 (1973)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Wormald, N.C.: Models of random regular graphs. Surv. Comb. 267, 239–298 (1999)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Amotz Bar-Noy
    • 1
  • Keerti Choudhary
    • 2
  • David Peleg
    • 2
  • Dror Rawitz
    • 3
    Email author
  1. 1.City University of New York (CUNY)New YorkUSA
  2. 2.Weizmann Institute of ScienceRehovotIsrael
  3. 3.Bar Ilan UniversityRamat-GanIsrael

Personalised recommendations