On the smallest edge defining sets of graphs

被引：0
|
作者：
Akbari, S
Khosrovshahi, GB
机构：
[1] Sharif Univ Technol, Dept Math Sci, Tehran, Iran
[2] Univ Tehran, Dept Math, Tehran, Iran
[3] Inst Studies Theoret Phys & Math, Tehran, Iran
来源：
ARS COMBINATORIA | 2002年 / 63卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For a given sequence of nonincreasing numbers, d = (d(1),..., d(n)), a necessary and sufficient condition is presented to characterize d when its realization is a unique labelled simple graph. If G is a graph, we consider the subgraph G' of G with maximum edges which is uniquely determined with respect to its degree sequence. We call the set of E(G)\E(G') the smallest edge defining set of G. This definition coincides with the similar one in design theory.
引用
收藏
页码：293 / 303
页数：11
相关论文
共 50 条
  • [1] Constructing regular graphs with smallest defining number
    Omoomi, Behnaz
    Soltankhah, Nasrin
    ARS COMBINATORIA, 2009, 91 : 19 - 31
  • [2] Smallest defining sets of directed triple systems
    Grannell, M. J.
    Griggs, T. S.
    Quinn, K. A. S.
    DISCRETE MATHEMATICS, 2009, 309 (14) : 4810 - 4818
  • [3] GRAPHS WITH THE SMALLEST NUMBER OF MINIMUM CUT SETS
    SMITH, D
    NETWORKS, 1984, 14 (01) : 47 - 61
  • [4] On the defining sets of some special graphs
    Mahmoodian, E. S.
    Omoomi, Behnaz
    Peng, Y. H.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2006, 35 : 69 - 81
  • [5] EDGE DOMINATING SETS IN GRAPHS
    YANNAKAKIS, M
    GAVRIL, F
    SIAM JOURNAL ON APPLIED MATHEMATICS, 1980, 38 (03) : 364 - 372
  • [6] On edge-sets of bicliques in graphs
    Groshaus, Marina
    Hell, Pavol
    Stacho, Juraj
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (18) : 2698 - 2708
  • [7] EDGE OPEN PACKING SETS IN GRAPHS
    Chelladurai, Gayathri
    Kalimuthu, Karuppasamy
    Soundararajan, Saravanakumar
    RAIRO-OPERATIONS RESEARCH, 2022, 56 (05) : 3765 - 3776
  • [8] Feedback edge sets in temporal graphs
    Haag, Roman
    Molter, Hendrik
    Niedermeier, Rolf
    Renken, Malte
    DISCRETE APPLIED MATHEMATICS, 2022, 307 : 65 - 78
  • [9] Efficient coverage of edge sets in graphs
    Dunbar, JE
    Hattingh, JH
    McRae, AA
    Slater, PJ
    UTILITAS MATHEMATICA, 1997, 51 : 183 - 192
  • [10] An algorithm for completing partials, with an application to the smallest defining sets of the STS(15)
    Ramsay, C
    UTILITAS MATHEMATICA, 1997, 52 : 205 - 221
12345