Realizability of Graphs
β Scribed by Maria Belk; Robert Connelly
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 173 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider the problem of constructing a matrix with prescribed row and Γ 4 column sums, subject to the condition that the off-diagonal entries are in 0, 1 and the diagonal entries are nonnegative integers. The pair of row and column sum vectors is called realizable if such a matrix exists. This is
A graph H is (1,2)-realizable if there exists a graph G in which each vertex has the first neighbourhood as well as the second neighbourhood isomorphic to H. We prove that if a ( I, 2)realizable graph H has n vertices, n > 3, then there is a unique connected graph G which realizes it and that G has