AN EXTREMAL PROBLEM FOR EDGE DOMINATION INSENSITIVE GRAPHS

被引:13
|
作者
DUTTON, RD [1 ]
BRIGHAM, RC [1 ]
机构
[1] UNIV CENT FLORIDA,DEPT MATH,ORLANDO,FL 32816
关键词
D O I
10.1016/0166-218X(88)90058-3
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:113 / 125
页数:13
相关论文
共 50 条
  • [1] An extremal problem for total domination stable graphs upon edge removal
    Desormeaux, Wyatt J.
    Haynes, Teresa W.
    Henning, Michael A.
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (10) : 1048 - 1052
  • [2] EXTREMAL GRAPHS DOMINATION INSENSITIVE TO THE REMOVAL OF K-EDGES
    HAYNES, TW
    BRIGHAM, RC
    DUTTON, RD
    DISCRETE APPLIED MATHEMATICS, 1993, 44 (1-3) : 295 - 304
  • [3] A note on extremal total domination edge critical graphs
    Hanson, D
    Wang, P
    UTILITAS MATHEMATICA, 2003, 63 : 89 - 96
  • [4] Strong Edge Geodetic Problem on Complete Multipartite Graphs and Some Extremal Graphs for the Problem
    Klavzar, Sandi
    Zmazek, Eva
    BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2024, 50 (01)
  • [5] Strong Edge Geodetic Problem on Complete Multipartite Graphs and Some Extremal Graphs for the Problem
    Sandi Klavžar
    Eva Zmazek
    Bulletin of the Iranian Mathematical Society, 2024, 50
  • [6] Edge domination in graphs
    Arumugam, S
    Velammal, S
    TAIWANESE JOURNAL OF MATHEMATICS, 1998, 2 (02): : 173 - 179
  • [7] Perfect edge domination and efficient edge domination in graphs
    Lu, CL
    Ko, MT
    Tang, CY
    DISCRETE APPLIED MATHEMATICS, 2002, 119 (03) : 227 - 250
  • [8] Algorithms and hardness results for edge total domination problem in graphs
    Henning, Michael A.
    Pandey, Arti
    Sharma, Gopika
    Tripathi, Vikash
    THEORETICAL COMPUTER SCIENCE, 2024, 982
  • [9] Extremal graphs for inequalities involving domination parameters
    Baogen, X
    Cockayne, EJ
    Haynes, TW
    Hedetniemi, ST
    Shangchao, Z
    DISCRETE MATHEMATICS, 2000, 216 (1-3) : 1 - 10
  • [10] EXTREMAL GRAPHS FOR A BOUND ON THE ROMAN DOMINATION NUMBER
    Bouchou, Ahmed
    Blidia, Mostafa
    Chellali, Mustapha
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2020, 40 (03) : 771 - 785