THE IRREDUNDANCE NUMBER AND MAXIMUM DEGREE OF A GRAPH

被引:9
|
作者
BOLLOBAS, B [1 ]
COCKAYNE, EJ [1 ]
机构
[1] UNIV VICTORIA,DEPT MATH,VICTORIA V8W 2Y2,BC,CANADA
关键词
D O I
10.1016/0012-365X(84)90118-3
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:197 / 199
页数:3
相关论文
共 50 条
  • [1] Open irredundance and maximum degree in graphs
    Cockayne, E. J.
    Favaron, O.
    Finbow, S.
    Mynhardt, C. M.
    DISCRETE MATHEMATICS, 2008, 308 (23) : 5358 - 5375
  • [2] Irredundance saturation number of a graph
    Arumugam, S.
    Favaron, Odile
    Sudha, S.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2010, 46 : 37 - 49
  • [3] OC-irredundance, CO-irredundance and maximum degree in trees
    Department of Mathematics and Statistics, University of Victoria, P.O. Box 3045 STN CSC, Victoria, BC V8W 3P4, Canada
    J. Comb. Math. Comb. Comp., 2008, (163-173):
  • [4] The ratio of the irredundance and domination number of a graph
    Volkmann, L
    DISCRETE MATHEMATICS, 1998, 178 (1-3) : 221 - 228
  • [5] Inequalities involving the irredundance number of a graph
    Speed, SE
    DISCRETE MATHEMATICS, 2005, 304 (1-3) : 117 - 120
  • [6] Irredundance, secure domination and maximum degree in trees
    Cockayne, E. J.
    DISCRETE MATHEMATICS, 2007, 307 (01) : 12 - 17
  • [7] THE RAMSEY NUMBER OF A GRAPH WITH BOUNDED MAXIMUM DEGREE
    CHVATAL, C
    RODL, V
    SZEMEREDI, E
    TROTTER, WT
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1983, 34 (03) : 239 - 243
  • [8] The maximum number of complete subgraphs in a graph with given maximum degree
    Cutler, Jonathan
    Radcliffe, A. J.
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2014, 104 : 60 - 71
  • [9] OO-Irredundance and maximum degree in paths and trees
    Cockayne, E.J.
    Finbow, S.
    Swarts, J.S.
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2010, 73 : 223 - 236
  • [10] The Number of Independent Sets in a Graph with Small Maximum Degree
    David Galvin
    Yufei Zhao
    Graphs and Combinatorics, 2011, 27 : 177 - 186