FACTOR DOMINATION IN GRAPHS

被引：27
|
作者：
BRIGHAM, RC [1 ]
DUTTON, RD [1 ]
机构：
[1] UNIV CENT FLORIDA,DEPT COMP SCI,ORLANDO,FL 32816
来源：
DISCRETE MATHEMATICS | 1990年 / 86卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(90)90355-L
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Given a factoring of a graph, the factor domination number gamma-f is the smallest number of nodes which dominate all factors. General results, mainly involving bounds on gamma-f for factoring of arbitrary graphs, are presented, and some of these are generalizations of well known relationships. The special case of two-factoring K(p) into a graph G and its complement GBAR receives special emphasis.
引用
收藏
页码：127 / 136
页数：10
相关论文
共 50 条
  • [1] 3-Factor-criticality in domination critical graphs
    Ananchuen, Nawarat
    Plummer, Michael D.
    [J]. DISCRETE MATHEMATICS, 2007, 307 (23) : 3006 - 3015
  • [2] Capacitated Domination: Constant Factor Approximations for Planar Graphs
    Kao, Mong-Jen
    Lee, D. T.
    [J]. ALGORITHMS AND COMPUTATION, 2011, 7074 : 494 - 503
  • [3] On -Domination in Graphs
    Das, Angsuman
    Laskar, Renu C.
    Rad, Nader Jafari
    [J]. GRAPHS AND COMBINATORICS, 2018, 34 (01) : 193 - 205
  • [4] On independent domination critical graphs and k-factor critical
    Ananchuen, N.
    Ruksasakchai, W.
    Ananchuen, W.
    [J]. ARS COMBINATORIA, 2016, 126 : 109 - 115
  • [5] Constant-factor approximation of the domination number in sparse graphs
    Dvorak, Zdenek
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (05) : 833 - 840
  • [6] Generalized domination and efficient domination in graphs
    Bange, DW
    Barkauskas, AE
    Host, LH
    Slater, PJ
    [J]. DISCRETE MATHEMATICS, 1996, 159 (1-3) : 1 - 11
  • [7] DOMINATION AND INDEPENDENT DOMINATION NUMBERS OF GRAPHS
    SEIFTER, N
    [J]. ARS COMBINATORIA, 1994, 38 : 119 - 128
  • [8] Domination versus disjunctive domination in graphs
    Henning, Michael A.
    Marcon, Sinclair A.
    [J]. QUAESTIONES MATHEMATICAE, 2016, 39 (02) : 261 - 273
  • [9] Graphs that are simultaneously efficient open domination and efficient closed domination graphs
    Klavzar, Sandi
    Peterin, Iztok
    Yero, Ismael G.
    [J]. DISCRETE APPLIED MATHEMATICS, 2017, 217 : 613 - 621
  • [10] Revisiting Domination, Hop Domination, and Global Hop Domination in Graphs
    Salasalan, Gemma
    Canoy Jr, Sergio R.
    [J]. EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2021, 14 (04): : 1415 - 1428
12345