Relations between graphs and integer-pair sequences
From MaRDI portal
Publication:1226508
DOI10.1016/0012-365X(76)90048-0zbMath0328.05139MaRDI QIDQ1226508
A. N. Patrinos, S. Louis Hakimi
Publication date: 1976
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Graph realizations constrained by skeleton graphs ⋮ Potentially 2-connected integer pair sequences ⋮ On existence of hypergraphs with prescribed edge degree profile ⋮ \(r\)-multihypergraphs with prescribed edge degree sequences ⋮ Matrices with prescribed row, column and block sums ⋮ Neighborhood degree lists of graphs ⋮ Degree polynomial for vertices in a graph and its behavior under graph operations ⋮ Characterization of unigraphic and unidigraphic integer-pair sequences ⋮ Graphs and degree sequences. I ⋮ On realizations of a joint degree matrix ⋮ Exact sampling of graphs with prescribed degree correlations ⋮ On the number of non-zero elements of joint degree vectors ⋮ Connected realizations of joint-degree matrices ⋮ An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem ⋮ Integer-pair sequences with self-complementary realizations ⋮ Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences ⋮ A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix ⋮ Sequences of degrees of edges of self-complementary graphs ⋮ A property of adjacency matrices of realizations of pair sequences ⋮ Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices
Cites Work
- Parallel concepts in graph theory
- On the degrees of the vertices of a directed graph
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- A Graph-Theoretic Approach to a Class of Integer-Programming Problems
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
- Partitions and Their Representative Graphs
