THE DEGREE SEQUENCE IS RECONSTRUCTIBLE FROM N-1 CARDS

被引：14
|
作者：
MYRVOLD, W
机构：
[1] Department of Computer Science, University of Victoria, Victoria, BC V8W 3P6
来源：
DISCRETE MATHEMATICS | 1992年 / 102卷 / 02期
关键词：
D O I：
10.1016/0012-365X(92)90053-I
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A vertex-deleted subgraph (or card) of a graph G is obtained from G by deleting the vertex v and all edges incident to v. In this paper, we prove that for all graphs on seven or more vertices, the degree sequence can be reconstructed from any (n - 1)-subset of the cards where n is the number of vertices of G.
引用
收藏
页码：187 / 196
页数：10
相关论文
共 50 条
12345