Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T. S. Ahuja, A. Tripathi: On the order of a graph with a given degree set. The Journal of Combinatorial Mathematics and Combinatorial Computing 57 (2006), 157–162.
P. Erdös, T. Gallai: Graphs with prescribed degrees of vertices. Mat. Lapok 11 (1960), 264–274. (In Hungarian.)
R. K. Guy: Unsolved Problems in Number Theory. Unsolved Problems in Intuitive Mathematics, Volume I, Third Edition. Springer-Verlag, New York, 2004.
S. L. Hakimi: On the realizability of a set of integers as degrees of the vertices of a graph. J. SIAM Appl. Math. 10 (1962), 496–506.
V. Havel: A remark on the existence of-nite graphs. Čas. Pěst. Mat. 80 (1955), 477–480. (In Czech.)
S. F. Kapoor, A. D. Polimeni, and C. E. Wall: Degree sets for graphs. Fund. Math. 95 (1977), 189–194.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gupta, G., Joshi, P. & Tripathi, A. Graphic sequences of trees and a problem of Frobenius. Czech Math J 57, 49–52 (2007). https://doi.org/10.1007/s10587-007-0042-z
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10587-007-0042-z