ON REALIZABILITY OF A SET OF INTEGERS AS DEGREES OF THE VERTICES OF A LINEAR GRAPH
Abstract
The realizability of a set of n integers as the degrees of vertices of an n-vertex linear graph is discussed. Other related problems, such as when a set of integers is realizable as a connected graph, connected graph without parallel elements, separable graph, and non-separable graph, are considered. The relationship between this problem and the problem of isomers in the organic chemistry is described. A similar problem in weight d graphs is also studied. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1961
- Accession Number
- AD0267092
Entities
People
- S.l. Hakimi
Organizations
- University of Illinois Urbana–Champaign