A sequence {d (1), d (2), . . . , d (n) } of nonnegative integers is graphic (multigraphic) if there exists a simple graph (multigraph) with vertices v (1), v (2), . . . , v (n) such that the degree d(v (i) ) of the vertex v (i) equals d (i) for each i = 1, 2, . . . , n. The (multi) graphic degree sequence problem is: Given a sequence of nonnegative integers, determine whether it is (multi)graphic or not. In this paper we characterize sequences that are multigraphic in a similar way, Havel (Äaut OE asopis PÄaut > st Mat 80:477-480, 1955) and Hakimi (J Soc Indust Appl Math 10:496-506, 1962) characterized graphic sequences. Results of Hakimi (J Soc Indust Appl Math 10:496-506, 1962) and Butler, Boesch and Harary (IEEE Trans Circuits Syst CAS-23(12):778-782, 1976) follow.
展开▼
机译:序列{d(1),d(2),。 。 。如果存在具有顶点v(1),v(2),...的简单图(multigraph),则非负整数的非图形整数是图形(multigraphic)。 。 。 ,v(n)使得顶点v(i)的度d(v(i))等于每个i = 1,2,...的d(i)。 。 。 ,n。 (多重)图形度序列问题是:给定一个非负整数序列,确定它是否是(多重)图形。在本文中,我们以相似的方式描述了多图形序列,Havel(&Aumlaut OE asopis P&Aumlaut> st Mat 80:477-480,1955)和Hakimi(J Soc Indust Appl Math 10:496-506,1962)表征了图形序列。 。随后是Hakimi(J Soc Indust Appl Math 10:496-506,1962)和Butler,Boesch and Harary(IEEE Trans Circuits Syst CAS-23(12):778-782,1976)的结果。
展开▼