Graph realization problem

Short description: Existence of a graph with a degree sequence

Two non-isomorphic graphs realized from the degree sequence (3, 2, 2, 2, 2, 1, 1, 1).

The graph realization problem is a decision problem in graph theory. Given a finite sequence (d1,…,dn) of natural numbers, the problem asks whether there is a labeled simple graph such that (d1,…,dn) is the degree sequence of this graph.

In the context of localization, the graph realization problem may also refer to finding a set of positions (x1,…,xn) in some Euclidean space such that the squared distances between the positions, given by dij2, match the edge weights wij for all edges in an incomplete, undirected, weighted graph.[1]

## Contents

* 1 Solutions
* 2 Other notations
* 3 Related problems
* 4 References

## Solutions

The problem can be solved in polynomial time. One method of showing this uses the Havel–Hakimi algorithm constructing a special solution with the use of a recursive algorithm.[2][3] Alternatively, following the characterization given by the Erdős–Gallai theorem, the problem can be solved by testing the validity of n inequalities.[4]

## Other notations

The problem can also be stated in terms of symmetric matrices of zeros and ones. The connection can be seen if one realizes that each graph has an adjacency matrix where the column sums and row sums correspond to (d1,…,dn). The problem is then sometimes denoted by symmetric 0-1-matrices for given row sums.

## Related problems

Similar problems describe the degree sequences of simple bipartite graphs or the degree sequences of simple directed graphs. The first problem is the so-called bipartite realization problem. The second is known as the digraph realization problem.

The problem of constructing a solution for the graph realization problem with the additional constraint that each such solution comes with the same probability was shown to have a polynomial-time approximation scheme for the degree sequences of regular graphs by Cooper, Martin, and Greenhill.[5] The general problem is still unsolved.

## References

1. ↑ Ding, Yichuan; Krislock, Nathan (2008), "Sensor Network Localization, Euclidean Distance Matrix Completions, and Graph Realization", Proceedings of the First ACM International Workshop on Mobile Entity Localization and Tracking in GPS-Less Environments: 129–134
2. ↑ Havel, Václav (1955), "A remark on the existence of finite graphs" (in Czech), Časopis Pro Pěstování Matematiky 80 (4): 477–480, doi:10.21136/CPM.1955.108220, http://eudml.org/doc/19050 .
3. ↑ "On realizability of a set of integers as degrees of the vertices of a linear graph. I", Journal of the Society for Industrial and Applied Mathematics 10 (3): 496–506, 1962, doi:10.1137/0110037 .
4. ↑ "Gráfok előírt fokszámú pontokkal", Matematikai Lapok 11: 264–274, 1960, http://www.renyi.hu/~p_erdos/1961-05.pdf .
5. ↑ Cooper, Colin (2007), "Sampling regular graphs and a peer-to-peer network", Combinatorics, Probability and Computing 16 (4): 557–593, doi:10.1017/S0963548306007978 .

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Graph realization problem. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Graph_realization_problem&oldid=3979057"