ON REALIZABILITY OF A SET OF INTEGERS AS DEGREES OF THE VERTICES OF A LINEAR GRAPH .1.
ON REALIZABILITY OF A SET OF INTEGERS AS DEGREES OF THE VERTICES OF A LINEAR GRAPH .1.
复制标题
DOI：
10.1137/0110037
复制
发表时间：
1962-01-01
期刊：
影响因子：
--
通讯作者：
HAKIMI, SL
中科院分区：
文献类型：
--
作者：
HAKIMI, SL
本文主要研究了一组非整数作为非顶点线性图的顶点度的可实现性。其他相关问题，如当一组整数可实现为连通图时，无“并行”元素的连通图，可分离图和不可分离图。描述了该问题与有机化学中同分异构体问题的关系。本文还研究了加权图中的一个类似问题。
This paper is mainly concerned with the realizability of a set ofnintegers as the degrees of vertices of ann-vertex linear graph. Other related problems, such as when a set of integers is realizable as a connected graph, connected graph without “parallel” elements, separable graph, and nonseparable graph, are considered. The relationship between this problem and the problem of isomers in the organic chemistry is described. A similar problem in weighted graphs is also studied.