THE DEGREE SEQUENCE IS RECONSTRUCTIBLE FROM N-1 CARDS

被引:14
|
作者
MYRVOLD, W
机构
[1] Department of Computer Science, University of Victoria, Victoria, BC V8W 3P6
关键词
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 条
  • [21] ON DIVIDING BY N-1
    LYERLY, SB
    PSYCHOLOGICAL REPORTS, 1961, 8 (03) : 457 - 458
  • [22] Semisimple restrictions from GL(n) to GL(n-1)
    Brundan, J
    Kleshchev, A
    Suprunenko, I
    JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 1998, 500 : 83 - 112
  • [23] Ward N-1
    Scherr, Julian M.
    LIBRARY JOURNAL, 1955, 80 (19) : 2519 - 2520
  • [24] THE N-1 COMPASS
    ROSALER, RC
    PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1954, 42 (03): : 608 - 608
  • [25] THE DESULFONAMIDATION OF N-1,N-1 DIETHYL-3,5-DIBROMOSULFANILAMIDE
    MOSER, CM
    MELVILLE, GS
    JOURNAL OF THE AMERICAN CHEMICAL SOCIETY, 1950, 72 (08) : 3812 - 3813
  • [27] A TFSK Transceiver Combining (n, n(n-1), n-1) Permutation Group Codes with MFSK
    Peng, Li
    Li, Gaofeng
    Liang, Kun
    Zhou, Bo
    2017 IEEE 9TH INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS (ICCSN), 2017, : 61 - 65
  • [28] 巧用(n(n-1))/2和n(n-1)解决实际问题
    陈永志
    中学教学参考, 2020, (23) : 27 - 28
  • [29] On the integers of the form n(n-1)-1
    Filipponi, P
    Brugia, O
    FIBONACCI QUARTERLY, 1999, 37 (03): : 262 - 264
  • [30] All solvable extensions of a class of nilpotent Lie algebras of dimension n and degree of nilpotency n-1
    Snobl, L.
    Winternitz, P.
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2009, 42 (10)