Accession Number : AD0267092

Title :   ON REALIZABILITY OF A SET OF INTEGERS AS DEGREES OF THE VERTICES OF A LINEAR GRAPH

Corporate Author : ILLINOIS UNIV URBANA ELECTRICAL ENGINEERING RESEARCH LAB

Personal Author(s) : HAKIMI,S.L.

Report Date : 01 SEP 1961

Pagination or Media Count : 1

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)

Descriptors :   *ELECTRICAL NETWORKS, *NUMBER THEORY, *ORGANIC COMPOUNDS, CIRCUITS, MATHEMATICAL ANALYSIS, MATHEMATICAL LOGIC, MOLECULAR ISOMERISM, MOLECULAR STRUCTURE

Distribution Statement : APPROVED FOR PUBLIC RELEASE