On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- 1 September 1962
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in Journal of the Society for Industrial and Applied Mathematics
- Vol. 10 (3), 496-506
- https://doi.org/10.1137/0110037
Abstract
Summary:We give a necessary and sufficient condition for the existence of a tree of order $n$ with a given degree set. We relate this to a well-known linear Diophantine problem of Frobenius
Keywords
This publication has 1 reference indexed in Scilit:
- Non-separable and planar graphsTransactions of the American Mathematical Society, 1932