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 条
  • [11] An algebraic approach to sets defining minimal dominating sets of regular graphs
    Nasernejad, Mehrdad
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2023, 11 (02) : 401 - 409
  • [12] Smallest generalized cuts and diameter-increasing sets of Johnson graphs
    Ning, Wantao
    Li, Qiuli
    Zhang, Heping
    ARS COMBINATORIA, 2010, 95 : 353 - 362
  • [13] Defining sets in vertex colorings of graphs and Latin rectangles
    Mahmoodian, ES
    Naserasr, R
    Zaker, M
    DISCRETE MATHEMATICS, 1997, 167 : 451 - 460
  • [14] EDGE-SETS OF RIGID AND CORIGID GRAPHS
    HELL, P
    NESETRIL, J
    MATHEMATISCHE NACHRICHTEN, 1979, 87 : 63 - 69
  • [15] Edge Geodetic Dominating Sets of Some Graphs
    Quije, Clint Joy M.
    Mariano, Rochelleo E.
    Ahmad, Eman C.
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2025, 18 (01):
  • [16] Eulerian edge sets in locally finite graphs
    Eli Berger
    Henning Bruhn
    Combinatorica, 2011, 31 : 21 - 38
  • [17] Edge search in graphs with restricted test sets
    Gerzen, T.
    DISCRETE MATHEMATICS, 2009, 309 (20) : 5932 - 5942
  • [18] Eulerian edge sets in locally finite graphs
    Berger, Eli
    Bruhn, Henning
    COMBINATORICA, 2011, 31 (01) : 21 - 38
  • [19] Monitoring Edge-Geodetic Sets in Graphs
    Foucaud, Florent
    Narayanan, Krishna
    Sulochana, Lekshmi Ramasubramony
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2023, 2023, 13947 : 245 - 256
  • [20] Edge-signed graphs with smallest eigenvalue greater than - 2
    Greaves, Gary
    Koolen, Jack
    Munemasa, Akihiro
    Sano, Yoshio
    Taniguchi, Tetsuji
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 110 : 90 - 111
12345