Graph Realizations Constrained by Skeleton Graphs

  • Péter L. Erdős
  • Stephen G. Hartke
  • Leo van Iersel
  • István Miklós
Keywords: Degree sequences, Joint degree matrix, Partition adjacency matrix, Skeleton graph, Forbidden edges, Tutte gadget, Edmonds' blossom algorithm


In 2008 Amanatidis, Green and Mihail introduced the Joint Degree Matrix (JDM) model to capture the fundamental difference in assortativity of networks in nature studied by the physical and life sciences and social networks studied in the social sciences.  In 2014 Czabarka proposed a direct generalization of the JDM model, the Partition Adjacency Matrix (PAM) model. In the PAM model the vertices have specified degrees, and the vertex set itself is partitioned into classes. For each pair of vertex classes the number of edges between the classes in a graph realization is prescribed. In this paper we apply the new skeleton graph model to describe the same information as the PAM model. Our model is more convenient for handling problems with low number of partition classes or with special topological restrictions among the classes. We investigate two particular cases in detail: (i) when there are only two vertex classes and (ii) when the skeleton graph contains at most one cycle.
Article Number