Skip to main content
MathOverflow

Return to Answer

added 72 characters in body
Source Link
Max Alekseyev
Max Alekseyev
  • 34.3k
  • 5
  • 74
  • 152

Replace each $-1$ with $0$. Then the matrix you look for is the adjacency matrix of a graph with a given degree sequence $r_1, r_2, \dots$. Reconstruction of such a graph (and its adjacency matrix) is known as the graph realization problem. E.g., see Wikipedia or this webpage for additional details and solutions.

Replace each $-1$ with $0$. Then the matrix you look for is the adjacency matrix of a graph with a given degree sequence $r_1, r_2, \dots$. Reconstruction of such a graph (and its adjacency matrix) is known as the graph realization problem. E.g., see this webpage for additional details and solutions.

Replace each $-1$ with $0$. Then the matrix you look for is the adjacency matrix of a graph with a given degree sequence $r_1, r_2, \dots$. Reconstruction of such a graph (and its adjacency matrix) is known as the graph realization problem. E.g., see Wikipedia or this webpage for additional details and solutions.

Source Link
Max Alekseyev
Max Alekseyev
  • 34.3k
  • 5
  • 74
  • 152

Replace each $-1$ with $0$. Then the matrix you look for is the adjacency matrix of a graph with a given degree sequence $r_1, r_2, \dots$. Reconstruction of such a graph (and its adjacency matrix) is known as the graph realization problem. E.g., see this webpage for additional details and solutions.