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 条
  • [21] Smallest 2-edge-connected graphs without a spanning trail
    Niu, Zhaohong
    Xiong, Liming
    Zhang, Shumin
    UTILITAS MATHEMATICA, 2012, 88 : 381 - 397
  • [22] GRAPHS WITH UNIQUE MINIMUM EDGE DOMINATING SETS AND GRAPHS WITH UNIQUE MAXIMUM INDEPENDENT SETS OF VERTICES
    TOPP, J
    DISCRETE MATHEMATICS, 1993, 121 (1-3) : 199 - 210
  • [23] Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
    Foucaud, Florent
    Marcille, Clara
    Myint, Zin Mar
    Sandeep, R. B.
    Sen, Sagnik
    Taruni, S.
    DISCRETE APPLIED MATHEMATICS, 2025, 366 : 106 - 119
  • [24] Minimal defining sets of 1-factorizations of complete graphs
    Cavenagh, Nicholas J.
    Donovan, Diane
    Khodkar, Abdollah
    UTILITAS MATHEMATICA, 2008, 76 : 191 - 211
  • [25] SMALLEST DEFINING SETS OF SOME SMALL T-DESIGNS AND RELATIONS TO THE PETERSEN GRAPH
    GREENHILL, CS
    STREET, AP
    UTILITAS MATHEMATICA, 1995, 48 : 5 - 31
  • [26] Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Papadopoulos, Charis
    Parotsidis, Nikos
    ALGORITHMS - ESA 2015, 2015, 9294 : 582 - 594
  • [27] Extremal Edge General Position Sets in Some Graphs
    Tian, Jing
    Klavzar, Sandi
    Tan, Elif
    GRAPHS AND COMBINATORICS, 2024, 40 (02)
  • [28] On nonfeasible edge sets in matching-covered graphs
    Zhao, Xiao
    Dong, Fengming
    Chen, Sheng
    JOURNAL OF GRAPH THEORY, 2020, 95 (02) : 192 - 208
  • [29] Extremal Edge General Position Sets in Some Graphs
    Jing Tian
    Sandi Klavžar
    Elif Tan
    Graphs and Combinatorics, 2024, 40
  • [30] Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
    Brandstaedt, Andreas
    Leitert, Arne
    Rautenbach, Dieter
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 267 - 277
12345