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 条

[31] The rigidity of Clifford torus S-1(root 1/n)xS(n-1)(root n-1/n)
Cheng, QM
COMMENTARII MATHEMATICI HELVETICI, 1996, 71 (01) : 60 - 69
[32] 关于Diophantine方程（a~n-1）(（a+1）~n-1)=x2
梁明
数学杂志, 2012, 32 (03) : 511 - 514
[33] On plane curves of degree n with a multiple point of order n-1 and a conic of 2n point contact
Hilton, H
PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 1922, 20 : 93 - 100
[34] On the refraction of N and N-1 rays
Becquerel, J
COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES, 1904, 139 : 267 - 270
[35] Hermitian metrics, (n-1, n-1) forms and Monge-Ampere equations
Tosatti, Valentino
Weinkove, Ben
JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 2019, 755 : 67 - 101
[36] 对公式(n-1)+(n-2)+…+2+1=n(n-1)/2的认识
王本友
中学生数学, 2004, (16) : 12 - 11
[37] SYNTHESIS OF HEXASUBSTITUTED CARBAMIMIDIC ACID ANHYDRIDES AND OF N-1,N-1,N-2-TRISUBSTITUTED FORMAMIDINES FROM 1,1,3-TRISUBSTITUTED UREAS
TORIZUKA, M
KIKUGAWA, Y
NAGASHIMA, H
SYNTHESIS-STUTTGART, 1986, (03): : 226 - 228
[38] Classical Lienard equations of degree n ≥ 6 can have [n-1/2]+2 limit cycles
De Maesschalck, P.
Dumortier, F.
JOURNAL OF DIFFERENTIAL EQUATIONS, 2011, 250 (04) : 2162 - 2176
[39] JOHN CAGE: N-1
De Souza Lima, Henrique Rocha
POLEM!CA, 2014, 13 (02): : 1100 - 1118
[40] “N-1”供电环境
大众用电, 2005, (07) : 44 - 44

← 1 2 3 4 5 →