Independent domination in graphs: A survey and recent results

A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In this paper, we offer a survey of selected recent results on independent domination in graphs.

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 313; no. 7; pp. 839 - 854
Main Authors Goddard, Wayne, Henning, Michael A.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 06.04.2013
Subjects
Independent dominating
Independent dominating
Online AccessGet full text

Cover

Abstract A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In this paper, we offer a survey of selected recent results on independent domination in graphs.
AbstractList A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In this paper, we offer a survey of selected recent results on independent domination in graphs.
Author Goddard, Wayne
Henning, Michael A.
Author_xml – sequence: 1
  givenname: Wayne
  surname: Goddard
  fullname: Goddard, Wayne
  email: goddard@clemson.edu
  organization: School of Computing and Department of Mathematical Sciences, Clemson University, Clemson SC, 29634, USA
– sequence: 2
  givenname: Michael A.
  surname: Henning
  fullname: Henning, Michael A.
  email: mahenning@uj.ac.za
  organization: Department of Mathematics, University of Johannesburg, Auckland Park, 2006, South Africa
BookMark eNp9kM1qwzAMgM3oYG23F9gpL5BMshMnGduhlP0UCrts0JvxbGVzaZ1ip4W-_ZJ1px16kRDSJ6Rvwka-9cTYLUKGgPJunVkXTcYBeYaYgcALNsaq5KmscDViY-g7qZDF6opNYlxDX0tRjdnjwlvaUR98l9h267zuXOsT55OvoHff8T6ZJXEfDnRMtLdJIDNMBor7TRev2WWjN5Fu_vKUfTw_vc9f0-Xby2I-W6ZGAHQpl7xEARVqyY1sqNEWSsplDTIHLkxRa1FC2VCJnzUXpEuEHEjUhHlhKxBTVp32mtDGGKhRxnW_h3ZBu41CUIMGtVaDBjVoUIiq19Cj_B-6C26rw_E89HCCqH_q4CioaBx5Q9b1AjplW3cO_wGG43e6
CitedBy_id crossref_primary_10_1080_09720529_2019_1689609
crossref_primary_10_1080_09720529_2019_1689607
crossref_primary_10_1016_j_dam_2015_08_024
crossref_primary_10_1016_j_ipl_2024_106521
crossref_primary_10_1016_j_dam_2020_10_019
crossref_primary_10_11650_tjm_211005
crossref_primary_10_1007_s10100_023_00840_w
crossref_primary_10_1016_j_dam_2019_08_025
crossref_primary_10_1007_s00373_022_02600_0
crossref_primary_10_1002_jgt_22968
crossref_primary_10_1142_S1793830918500696
crossref_primary_10_4213_dm1357
crossref_primary_10_1007_s10878_024_01200_3
crossref_primary_10_1002_net_22220
crossref_primary_10_1016_j_dam_2014_06_005
crossref_primary_10_1007_s00453_022_00979_z
crossref_primary_10_1080_09728600_2020_1833692
crossref_primary_10_3390_a18030159
crossref_primary_10_1080_09720529_2014_914288
crossref_primary_10_1016_j_ins_2018_12_032
crossref_primary_10_1016_j_amc_2018_12_009
crossref_primary_10_1016_j_disc_2022_112994
crossref_primary_10_1007_s00373_020_02143_2
crossref_primary_10_1002_jgt_22711
crossref_primary_10_1016_j_dam_2023_09_028
crossref_primary_10_1017_fms_2023_46
crossref_primary_10_3390_sym12111846
crossref_primary_10_29121_shodhkosh_v5_i6_2024_2356
crossref_primary_10_3390_math9040402
crossref_primary_10_1002_qua_27211
crossref_primary_10_1016_j_dam_2014_07_001
crossref_primary_10_1142_S1793830922500446
crossref_primary_10_3390_sym13122399
crossref_primary_10_1007_s41980_019_00274_8
crossref_primary_10_1007_s10878_021_00767_5
crossref_primary_10_3390_math8060996
crossref_primary_10_1007_s00373_021_02431_5
crossref_primary_10_1002_jgt_21855
crossref_primary_10_1016_j_dam_2025_01_037
crossref_primary_10_1016_j_jet_2024_105844
crossref_primary_10_11648_j_acm_20241303_11
crossref_primary_10_1016_j_dam_2025_01_036
crossref_primary_10_1515_dma_2016_0028
crossref_primary_10_1556_314_2022_00015
crossref_primary_10_1016_j_dam_2018_11_018
crossref_primary_10_1016_j_amc_2020_125340
crossref_primary_10_1016_j_tcs_2021_05_036
crossref_primary_10_1016_j_knosys_2024_112791
crossref_primary_10_1007_s40840_022_01335_8
crossref_primary_10_1016_j_dam_2015_10_008
crossref_primary_10_1016_j_dam_2022_10_003
crossref_primary_10_1016_j_cor_2020_105157
crossref_primary_10_1016_j_dam_2020_03_019
crossref_primary_10_1007_s40840_022_01456_0
crossref_primary_10_1007_s00026_016_0331_z
crossref_primary_10_1007_s00373_019_02082_7
crossref_primary_10_1155_2013_595210
crossref_primary_10_1016_j_jcta_2020_105310
crossref_primary_10_1007_s00224_023_10132_0
crossref_primary_10_3390_a15110402
crossref_primary_10_1002_jcd_21527
crossref_primary_10_1016_j_cor_2023_106218
crossref_primary_10_1016_j_dam_2024_08_008
crossref_primary_10_1145_3452937
crossref_primary_10_3390_sym13081411
crossref_primary_10_1556_314_2023_00003
crossref_primary_10_1016_j_apal_2018_01_001
crossref_primary_10_1109_ACCESS_2018_2883028
crossref_primary_10_1016_j_dam_2025_03_024
crossref_primary_10_21595_mme_2024_24233
crossref_primary_10_1134_S1990478920020131
crossref_primary_10_1016_j_dam_2016_09_021
crossref_primary_10_3390_math7090820
crossref_primary_10_1007_s00373_019_02043_0
crossref_primary_10_1016_j_kjs_2024_100283
crossref_primary_10_1016_j_endm_2015_06_031
crossref_primary_10_1051_ro_2024178
crossref_primary_10_1007_s00224_020_09982_9
crossref_primary_10_4018_IJSSMET_2018040101
crossref_primary_10_1016_j_ejor_2023_03_022
crossref_primary_10_1007_s00373_021_02446_y
crossref_primary_10_1016_j_dam_2024_05_028
crossref_primary_10_1002_jgt_22912
crossref_primary_10_1080_10556788_2019_1679142
crossref_primary_10_1016_j_amc_2019_04_038
crossref_primary_10_1016_j_dam_2017_09_011
crossref_primary_10_1007_s10623_023_01314_5
crossref_primary_10_1007_s10878_021_00743_z
crossref_primary_10_1016_j_tcs_2015_05_002
crossref_primary_10_1007_s40305_022_00428_2
crossref_primary_10_1007_s00373_020_02269_3
crossref_primary_10_1016_j_dam_2023_02_007
crossref_primary_10_1007_s00009_023_02565_1
crossref_primary_10_1007_s00010_021_00778_x
crossref_primary_10_1103_PhysRevA_109_042201
crossref_primary_10_1007_s00453_018_0474_x
crossref_primary_10_1080_09728600_2024_2342310
crossref_primary_10_1016_j_disc_2020_111879
crossref_primary_10_1007_s00521_016_2324_6
crossref_primary_10_1016_j_dam_2021_08_013
crossref_primary_10_1088_1742_6596_1832_1_012022
crossref_primary_10_1016_j_dam_2024_06_005
crossref_primary_10_1016_j_disc_2017_08_025
crossref_primary_10_1109_ACCESS_2019_2919976
crossref_primary_10_1016_j_dam_2024_06_007
crossref_primary_10_1016_j_tcs_2024_114619
crossref_primary_10_1016_j_disc_2015_02_015
crossref_primary_10_15672_hujms_1095437
crossref_primary_10_1016_j_amc_2014_06_076
crossref_primary_10_1111_tops_12629
crossref_primary_10_1016_j_ins_2024_121765
crossref_primary_10_1142_S1793830918500246
crossref_primary_10_1007_s40840_017_0488_6
crossref_primary_10_1016_j_disc_2019_111727
crossref_primary_10_2989_16073606_2020_1834001
crossref_primary_10_1016_j_dam_2023_07_018
Cites_doi 10.1016/S0166-218X(98)00147-4
10.1016/0012-365X(91)90318-V
10.1016/S0012-365X(02)00496-X
10.1137/0138030
10.1007/BF02986690
10.1002/jgt.3190030306
10.1016/0012-365X(90)90347-K
10.1016/0166-218X(93)90178-Q
10.7151/dmgt.1398
10.1016/0893-9659(93)90027-K
10.4153/CMB-1978-079-5
10.1016/0012-365X(90)90358-O
10.1137/S0895480194275825
10.1080/16073606.1988.9632153
10.1016/j.disc.2009.06.017
10.1016/0012-365X(95)00094-D
10.1016/0898-1221(88)90213-1
10.1016/0020-0190(83)90091-1
10.1016/0167-6377(82)90015-3
10.1002/rsa.10047
10.1016/S0012-365X(97)00267-7
10.1016/0012-365X(94)00022-B
10.1016/0012-365X(78)90075-4
10.1016/j.disc.2007.07.010
10.1016/j.aml.2003.09.006
10.1016/j.disc.2012.01.003
10.1017/S0963548305007431
10.1002/jgt.3190170106
10.1016/S0012-365X(02)00451-X
10.1016/j.disc.2007.01.001
10.1016/0012-365X(94)00202-T
10.1006/jctb.1993.1005
10.1016/0012-365X(78)90105-X
10.7151/dmgt.1228
10.1007/s10878-010-9336-4
10.1002/jgt.1016
10.1002/(SICI)1097-0118(199907)31:3<163::AID-JGT2>3.0.CO;2-T
10.1016/0020-0190(91)90188-N
10.1006/jctb.1999.1907
10.7151/dmgt.1048
10.1016/j.disc.2005.09.013
10.37236/1573
10.1002/net.3230070305
10.1137/0406032
10.1016/j.disc.2009.10.012
10.1016/j.disc.2007.06.043
10.1002/(SICI)1097-0118(199701)24:1<21::AID-JGT3>3.0.CO;2-L
10.1016/0166-218X(84)90088-X
10.1007/BF02759743
10.1016/j.disopt.2010.02.004
10.1016/S0012-365X(00)00012-1
10.7151/dmgt.1023
10.1002/jgt.3190150202
10.1002/jgt.3190180707
10.1016/0012-365X(93)90288-5
10.1007/BF01788145
10.1016/S0012-365X(03)00032-3
10.1016/0166-218X(94)00117-V
10.1016/S0012-365X(98)00350-1
10.1002/jgt.20565
10.1016/0012-365X(76)90026-1
10.1002/jgt.3190200313
10.1080/16073606.1993.9631737
10.1007/BF02988308
10.1007/s00026-012-0155-4
10.1007/s00373-010-0997-7
10.1002/(SICI)1097-0118(199605)22:1<9::AID-JGT2>3.0.CO;2-S
10.1016/S0012-365X(01)00274-6
10.1016/S0021-9800(70)80011-4
10.1002/1097-0118(200008)34:4<277::AID-JGT4>3.0.CO;2-#
10.1016/0095-8956(83)90007-2
10.1016/j.disc.2003.06.011
10.1016/j.disc.2005.12.029
10.1016/0012-365X(88)90076-3
10.1016/0012-365X(91)90473-F
10.1016/0012-365X(91)90151-Q
10.1016/j.dam.2008.03.003
10.1016/j.disc.2006.04.031
10.1007/BF02988312
ContentType Journal Article
Copyright 2013 Elsevier B.V.
Copyright_xml – notice: 2013 Elsevier B.V.
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/j.disc.2012.11.031
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1872-681X
EndPage 854
ExternalDocumentID 10_1016_j_disc_2012_11_031
S0012365X13000083
GroupedDBID --K
--M
-DZ
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
4.4
457
4G.
5GY
5VS
6I.
6OB
7-5
71M
8P~
9JN
AACTN
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AASFE
AAXUO
ABAOU
ABJNI
ABMAC
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ADBBV
ADEZE
ADIYS
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ARUGR
AXJTR
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EO8
EO9
EP2
EP3
FDB
FEDTE
FIRID
FNPLU
FYGXN
G-Q
GBLVA
HVGLF
IHE
IXB
J1W
KOM
M26
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
RIG
ROL
RPZ
SDF
SDG
SDP
SES
SPC
SPCBC
SSW
SSZ
T5K
TN5
UPT
WH7
XPP
ZMT
~G-
29G
41~
6TJ
AAEDT
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABEFU
ABFNM
ABWVN
ACRPL
ACVFH
ADCNI
ADMUD
ADNMO
ADVLN
ADXHL
AEIPS
AEUPX
AFFNX
AFJKZ
AFPUW
AFXIZ
AGCQF
AGHFR
AGQPQ
AGRNS
AI.
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
BNPGV
CITATION
EJD
FA8
FGOYB
G-2
HZ~
MVM
R2-
RNS
SEW
SSH
VH1
WUQ
XJT
XOL
ZCG
ZY4
ID FETCH-LOGICAL-c300t-262713081a62c6fefad07e469064023c59a3707fe71b923ea71040e39e145d803
IEDL.DBID .~1
ISSN 0012-365X
IngestDate Thu Apr 24 23:07:06 EDT 2025
Tue Jul 01 04:10:55 EDT 2025
Fri Feb 23 02:17:05 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 7
Keywords Independent dominating
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c300t-262713081a62c6fefad07e469064023c59a3707fe71b923ea71040e39e145d803
OpenAccessLink https://www.sciencedirect.com/science/article/pii/S0012365X13000083
PageCount 16
ParticipantIDs crossref_citationtrail_10_1016_j_disc_2012_11_031
crossref_primary_10_1016_j_disc_2012_11_031
elsevier_sciencedirect_doi_10_1016_j_disc_2012_11_031
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2013-04-06
PublicationDateYYYYMMDD 2013-04-06
PublicationDate_xml – month: 04
  year: 2013
  text: 2013-04-06
  day: 06
PublicationDecade 2010
PublicationTitle Discrete mathematics
PublicationYear 2013
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Brigham, Carrington, Vitray (br000070) 2004; 275
Zelinka (br000590) 1983; 33
Valencia-Pabon (br000550) 2010; 310
A. Harutyunyan, P. Horn, J. Verstraete, Independent dominating sets in graphs of girth five, Manuscript
Heggernes, Telle (br000365) 1998; 5
van Lint, Wilson (br000565) 1992
Pfaff, Laskar, Hedetniemi (br000470) 1984; 45
Allan, Laskar (br000005) 1978; 23
Zverovich, Zverovich (br000605) 1995; 20
Dunbar, Hedetniemi, Hedetniemi, Jacobs, Knisely, Laskar, Rall (br000175) 2000; 33
Finbow, Hartnell, Nowakowski (br000210) 1993; 57
Garey, Johnson (br000240) 1979
Zverovich, Zverovich (br000600) 1991; 20
Cockayne, Hedetniemi (br000115) 1976; 15
Plummer (br000480) 1993; 16
Favaron (br000195) 1988; 70
2010.
Sumner, Blitch (br000520) 1983; 34
Zverovich, Zverovich (br000610) 1994; 10
Finbow, Hartnell (br000205) 1983; 16
Blidia, Chellali, Favaron, Meddah (br000045) 2008; 28
.
Ore (br000455) 1962; 38
Glebov, Kostochka (br000255) 1998; 188
Rosenfeld (br000495) 1964; 2
Duckworth, Wormald (br000170) 2006; 15
Cockayne, Favaron, Li, MacGillivray (br000090) 1991; 90
Ravindra (br000485) 1977; 2
MacGillivray, Seyffarth (br000420) 2004; 49
Östergård, Weakley (br000460) 2001; 8
Duckworth, Wormald (br000165) 2002; 21
Nowakowski, Rall (br000450) 1996; 16
Brešar, Dorbec, Goddard, Hartnell, Henning, Klavžar, Rall (br000065) 2012; 69
Gimbel, Vestergaard (br000250) 1995; 39
Yannakakis, Gavril (br000585) 1980; 38
Cockayne, Fricke, Mynhardt (br000100) 1995; 138
Campbell, Ellingham, Royle (br000080) 1993; 13
Finozhenok, Weakley (br000225) 2007; 37
Plummer (br000475) 1970; 8
J. Verstraete, personal communication, August 2010.
Lam, Shiu, Sun (br000400) 1999; 202
Bollobás, Cockayne (br000055) 1979; 3
Fulman (br000235) 1993; 17
Ao, Cockayne, MacGillivray, Mynhardt (br000010) 1996; 22
Haviland (br000315) 1995; 143
Haviland (br000325) 2007; 307
Beineke, Henning (br000025) 1994; 37
Haynes, Henning, Slater (br000350) 2003; 260
Hartnell, Plummer (br000300) 1996; 64
Haviland (br000320) 2008; 308
Goddard, Henning (br000265) 2003; 268
Payan (br000465) 1978; 23
Farber (br000190) 1981/82; 1
Goddard, Lyle (br000275) 2012; 23
van der Merwe, Mynhardt, Haynes (br000560) 1999; 27
Sun, Wang (br000530) 1999; 76
Manlove (br000430) 1999; 91
Haynes, Hedetniemi, Slater (br000335) 1998
Ma, Chen (br000425) 2004; 17
McFall, Nowakowski (br000435) 1980; 29
Lee (br000410) 2001; 37
Haynes, Henning (br000345) 2002; 248
Bange, Barkauskas, Host, Slater (br000015) 1996; 159
de Jaenisch (br000150) 1862
Vizing (br000575) 1963; 9
Dorfling, Goddard, Henning, Mynhardt (br000160) 2006; 306
Kostochka (br000390) 1993; 9
Sumner (br000515) 1990; 86
Cockayne, Hedetniemi (br000105) 1974; X
Cockayne, Mynhardt (br000130) 1991; 10
Dahme, Rautenbach, Volkmann (br000145) 2008; 308
Klavžar, Mekiš (br000385) 2011; 27
Fricke, Haynes, Hedetniemi, Hedetniemi, Laskar (br000230) 2002; 34
Yaglom, Yaglom (br000580) 1964
Edwards, MacGillivray (br000180) 2012; 52
Seifter (br000500) 1994; 38
Clark, Colbourn, Johnson (br000085) 1990; 86
Berge (br000035) 1973
Finbow, Hartnell, Nowakowski (br000215) 1994; 18
Hedetniemi, Hedetniemi, Rall (br000355) 2000; 222
Croitoru, Suditu (br000140) 1983; 17
Grinstead, Slater (br000280) 1990; 71
Harary, Livingston (br000290) 1986; 55
S.M. Hedetniemi, S.T. Hedetniemi, R. Reynolds, Combinatorial problems on chessboards. II, in: Domination in Graphs [67], pp. 133–162.
Žerovnik, Oplerova (br000595) 1993; 9
Berge (br000030) 1962
Cockayne, Hedetniemi, Miller (br000120) 1978; 21
G.S. Domke, G.H. Fricke, R.R. Laskar, A. Majumdar, Fractional domination and related parameters, in: Domination in Graphs [67], pp. 61–89.
Irving (br000375) 1991; 37
Cockayne, Favaron, Mynhardt, Puech (br000095) 2000; 34
Mynhardt (br000440) 1999; 31
Telle, Proskurowski (br000535) 1997; 10
Henning, Löwenstein, Rautenbach (br000370) 2009; 309
Fink, Jacobson (br000220) 1985
Shiu, Chen, Chan (br000505) 2010; 7
Blidia, Chellali, Maffray (br000050) 2006; 306
Borowiecki, Michalak, Sidorowicz (br000060) 1997; 17
L.C. van der Merwe, Total domination edge critical graphs, Ph.D. Thesis, University of South Africa, 1999.
J. Southey, M.A. Henning, Domination versus independent domination in cubic graphs, Discrete Math., in press
Goddard, Haynes, Knisley (br000260) 2004; 24
Mynhardt (br000445) 1988; 11
Harary, Livingston (br000295) 1993; 6
Reji Kumar, Arumugam, MacGillivray (br000490) 2008; 87
Cockayne, Hedetniemi (br000110) 1977; 7
Keil (br000380) 1993; 42
Beyer, Proskurowski, Hedetniemi, Mitchell (br000040) 1977; XIX
Kratsch, Stewart (br000395) 1993; 6
Topp, Volkmann (br000545) 1990; 1/2
Haynes, Hedetniemi, Slater (br000340) 1998
Laskar, Lyle (br000405) 2009; 157
Lyle, Drake, Laskar (br000415) 2005; 172
Sumner, Moore (br000525) 1979; 26
Haviland (br000310) 1991; 94
Favaron (br000200) 1992; 1
Gimbel, Henning (br000245) 1996; 20
Corneil, Perl (br000135) 1984; 9
Goddard, Henning, Lyle, Southey (br000270) 2012; 16
Harary, Hayes, Wu (br000285) 1988; 15
Brigham, Haynes, Henning, Rall (br000075) 2005; 305
Barefoot, Harary, Jones (br000020) 1991; 7
Topp, Volkmann (br000540) 1991; 96
Cockayne, Mynhardt (br000125) 1993; 122
Haynes, Hedetniemi, Henning, Slater (br000330) 2003; 262
Entringer, Goddard, Henning (br000185) 1997; 24
Finbow (10.1016/j.disc.2012.11.031_br000205) 1983; 16
Cockayne (10.1016/j.disc.2012.11.031_br000115) 1976; 15
Shiu (10.1016/j.disc.2012.11.031_br000505) 2010; 7
Haviland (10.1016/j.disc.2012.11.031_br000315) 1995; 143
Lyle (10.1016/j.disc.2012.11.031_br000415) 2005; 172
Yannakakis (10.1016/j.disc.2012.11.031_br000585) 1980; 38
Haviland (10.1016/j.disc.2012.11.031_br000320) 2008; 308
Finbow (10.1016/j.disc.2012.11.031_br000215) 1994; 18
Finozhenok (10.1016/j.disc.2012.11.031_br000225) 2007; 37
Kostochka (10.1016/j.disc.2012.11.031_br000390) 1993; 9
10.1016/j.disc.2012.11.031_br000570
Haviland (10.1016/j.disc.2012.11.031_br000310) 1991; 94
Hartnell (10.1016/j.disc.2012.11.031_br000300) 1996; 64
Harary (10.1016/j.disc.2012.11.031_br000285) 1988; 15
Seifter (10.1016/j.disc.2012.11.031_br000500) 1994; 38
Haynes (10.1016/j.disc.2012.11.031_br000350) 2003; 260
Ravindra (10.1016/j.disc.2012.11.031_br000485) 1977; 2
Reji Kumar (10.1016/j.disc.2012.11.031_br000490) 2008; 87
Allan (10.1016/j.disc.2012.11.031_br000005) 1978; 23
Ore (10.1016/j.disc.2012.11.031_br000455) 1962; 38
Haynes (10.1016/j.disc.2012.11.031_br000330) 2003; 262
Cockayne (10.1016/j.disc.2012.11.031_br000110) 1977; 7
Goddard (10.1016/j.disc.2012.11.031_br000270) 2012; 16
Borowiecki (10.1016/j.disc.2012.11.031_br000060) 1997; 17
Brigham (10.1016/j.disc.2012.11.031_br000070) 2004; 275
Zelinka (10.1016/j.disc.2012.11.031_br000590) 1983; 33
Žerovnik (10.1016/j.disc.2012.11.031_br000595) 1993; 9
Corneil (10.1016/j.disc.2012.11.031_br000135) 1984; 9
Favaron (10.1016/j.disc.2012.11.031_br000200) 1992; 1
Henning (10.1016/j.disc.2012.11.031_br000370) 2009; 309
Östergård (10.1016/j.disc.2012.11.031_br000460) 2001; 8
Berge (10.1016/j.disc.2012.11.031_br000030) 1962
Campbell (10.1016/j.disc.2012.11.031_br000080) 1993; 13
Goddard (10.1016/j.disc.2012.11.031_br000260) 2004; 24
Harary (10.1016/j.disc.2012.11.031_br000295) 1993; 6
Duckworth (10.1016/j.disc.2012.11.031_br000165) 2002; 21
Duckworth (10.1016/j.disc.2012.11.031_br000170) 2006; 15
Blidia (10.1016/j.disc.2012.11.031_br000050) 2006; 306
Klavžar (10.1016/j.disc.2012.11.031_br000385) 2011; 27
Clark (10.1016/j.disc.2012.11.031_br000085) 1990; 86
Cockayne (10.1016/j.disc.2012.11.031_br000105) 1974; X
Dorfling (10.1016/j.disc.2012.11.031_br000160) 2006; 306
Farber (10.1016/j.disc.2012.11.031_br000190) 1981; 1
Berge (10.1016/j.disc.2012.11.031_br000035) 1973
Cockayne (10.1016/j.disc.2012.11.031_br000100) 1995; 138
Valencia-Pabon (10.1016/j.disc.2012.11.031_br000550) 2010; 310
10.1016/j.disc.2012.11.031_br000510
Dahme (10.1016/j.disc.2012.11.031_br000145) 2008; 308
Edwards (10.1016/j.disc.2012.11.031_br000180) 2012; 52
Zverovich (10.1016/j.disc.2012.11.031_br000610) 1994; 10
Favaron (10.1016/j.disc.2012.11.031_br000195) 1988; 70
Finbow (10.1016/j.disc.2012.11.031_br000210) 1993; 57
Fulman (10.1016/j.disc.2012.11.031_br000235) 1993; 17
Lam (10.1016/j.disc.2012.11.031_br000400) 1999; 202
Topp (10.1016/j.disc.2012.11.031_br000545) 1990; 1/2
Croitoru (10.1016/j.disc.2012.11.031_br000140) 1983; 17
Harary (10.1016/j.disc.2012.11.031_br000290) 1986; 55
Cockayne (10.1016/j.disc.2012.11.031_br000130) 1991; 10
de Jaenisch (10.1016/j.disc.2012.11.031_br000150) 1862
10.1016/j.disc.2012.11.031_br000360
Telle (10.1016/j.disc.2012.11.031_br000535) 1997; 10
Fricke (10.1016/j.disc.2012.11.031_br000230) 2002; 34
Topp (10.1016/j.disc.2012.11.031_br000540) 1991; 96
Plummer (10.1016/j.disc.2012.11.031_br000475) 1970; 8
Gimbel (10.1016/j.disc.2012.11.031_br000250) 1995; 39
van Lint (10.1016/j.disc.2012.11.031_br000565) 1992
Haviland (10.1016/j.disc.2012.11.031_br000325) 2007; 307
Lee (10.1016/j.disc.2012.11.031_br000410) 2001; 37
Zverovich (10.1016/j.disc.2012.11.031_br000605) 1995; 20
Beineke (10.1016/j.disc.2012.11.031_br000025) 1994; 37
Kratsch (10.1016/j.disc.2012.11.031_br000395) 1993; 6
Nowakowski (10.1016/j.disc.2012.11.031_br000450) 1996; 16
Glebov (10.1016/j.disc.2012.11.031_br000255) 1998; 188
McFall (10.1016/j.disc.2012.11.031_br000435) 1980; 29
Cockayne (10.1016/j.disc.2012.11.031_br000120) 1978; 21
Blidia (10.1016/j.disc.2012.11.031_br000045) 2008; 28
Cockayne (10.1016/j.disc.2012.11.031_br000125) 1993; 122
Yaglom (10.1016/j.disc.2012.11.031_br000580) 1964
Brešar (10.1016/j.disc.2012.11.031_br000065) 2012; 69
Cockayne (10.1016/j.disc.2012.11.031_br000090) 1991; 90
Sumner (10.1016/j.disc.2012.11.031_br000520) 1983; 34
Sumner (10.1016/j.disc.2012.11.031_br000525) 1979; 26
Cockayne (10.1016/j.disc.2012.11.031_br000095) 2000; 34
Heggernes (10.1016/j.disc.2012.11.031_br000365) 1998; 5
Irving (10.1016/j.disc.2012.11.031_br000375) 1991; 37
Bange (10.1016/j.disc.2012.11.031_br000015) 1996; 159
Barefoot (10.1016/j.disc.2012.11.031_br000020) 1991; 7
Keil (10.1016/j.disc.2012.11.031_br000380) 1993; 42
Laskar (10.1016/j.disc.2012.11.031_br000405) 2009; 157
Mynhardt (10.1016/j.disc.2012.11.031_br000440) 1999; 31
Sun (10.1016/j.disc.2012.11.031_br000530) 1999; 76
Ma (10.1016/j.disc.2012.11.031_br000425) 2004; 17
van der Merwe (10.1016/j.disc.2012.11.031_br000560) 1999; 27
Manlove (10.1016/j.disc.2012.11.031_br000430) 1999; 91
Goddard (10.1016/j.disc.2012.11.031_br000275) 2012; 23
10.1016/j.disc.2012.11.031_br000305
Ao (10.1016/j.disc.2012.11.031_br000010) 1996; 22
Goddard (10.1016/j.disc.2012.11.031_br000265) 2003; 268
Hedetniemi (10.1016/j.disc.2012.11.031_br000355) 2000; 222
Pfaff (10.1016/j.disc.2012.11.031_br000470) 1984; 45
Brigham (10.1016/j.disc.2012.11.031_br000075) 2005; 305
MacGillivray (10.1016/j.disc.2012.11.031_br000420) 2004; 49
Payan (10.1016/j.disc.2012.11.031_br000465) 1978; 23
10.1016/j.disc.2012.11.031_br000555
Sumner (10.1016/j.disc.2012.11.031_br000515) 1990; 86
Haynes (10.1016/j.disc.2012.11.031_br000345) 2002; 248
10.1016/j.disc.2012.11.031_br000155
Garey (10.1016/j.disc.2012.11.031_br000240) 1979
Haynes (10.1016/j.disc.2012.11.031_br000335) 1998
Zverovich (10.1016/j.disc.2012.11.031_br000600) 1991; 20
Vizing (10.1016/j.disc.2012.11.031_br000575) 1963; 9
Plummer (10.1016/j.disc.2012.11.031_br000480) 1993; 16
Bollobás (10.1016/j.disc.2012.11.031_br000055) 1979; 3
Gimbel (10.1016/j.disc.2012.11.031_br000245) 1996; 20
Rosenfeld (10.1016/j.disc.2012.11.031_br000495) 1964; 2
Beyer (10.1016/j.disc.2012.11.031_br000040) 1977; XIX
Haynes (10.1016/j.disc.2012.11.031_br000340) 1998
Dunbar (10.1016/j.disc.2012.11.031_br000175) 2000; 33
Mynhardt (10.1016/j.disc.2012.11.031_br000445) 1988; 11
Entringer (10.1016/j.disc.2012.11.031_br000185) 1997; 24
Grinstead (10.1016/j.disc.2012.11.031_br000280) 1990; 71
Fink (10.1016/j.disc.2012.11.031_br000220) 1985
References_xml – start-page: 301
  year: 1985
  end-page: 311
  ident: br000220
  article-title: On
  publication-title: Graph Theory with Applications to Algorithms and Computer Science (Kalamazoo, MI, 1984)
– volume: 138
  start-page: 199
  year: 1995
  end-page: 205
  ident: br000100
  article-title: On a Nordhaus–Gaddum type problem for independent domination
  publication-title: Discrete Math.
– volume: 20
  start-page: 193
  year: 1996
  end-page: 205
  ident: br000245
  article-title: Bounds on an independent distance domination parameter
  publication-title: J. Combin. Comput. Combin. Math.
– volume: 308
  start-page: 3545
  year: 2008
  end-page: 3550
  ident: br000320
  article-title: Independent domination in triangle-free graphs
  publication-title: Discrete Math.
– reference: ).
– reference: J. Verstraete, personal communication, August 2010.
– volume: 37
  start-page: 213
  year: 2001
  end-page: 219
  ident: br000410
  article-title: Independent perfect domination sets in Cayley graphs
  publication-title: J. Graph Theory
– volume: 23
  start-page: 9
  year: 2012
  end-page: 20
  ident: br000275
  article-title: Independent dominating sets in triangle-free graphs
  publication-title: J. Comb. Optim.
– volume: 94
  start-page: 95
  year: 1991
  end-page: 101
  ident: br000310
  article-title: On minimum maximal independent sets of a graph
  publication-title: Discrete Math.
– year: 1962
  ident: br000030
  article-title: Theory of Graphs and its Applications
– volume: 91
  start-page: 155
  year: 1999
  end-page: 175
  ident: br000430
  article-title: On the algorithmic complexity of twelve covering and independence parameters of graphs
  publication-title: Discrete Appl. Math.
– volume: 96
  start-page: 75
  year: 1991
  end-page: 80
  ident: br000540
  article-title: On graphs with equal domination and independent domination numbers
  publication-title: Discrete Math.
– volume: 20
  start-page: 375
  year: 1995
  end-page: 395
  ident: br000605
  article-title: An induced subgraph characterization of domination perfect graphs
  publication-title: J. Graph Theory
– volume: 20
  start-page: 109
  year: 1991
  end-page: 114
  ident: br000600
  article-title: A characterization of domination perfect graphs
  publication-title: J. Graph Theory
– volume: 275
  start-page: 299
  year: 2004
  end-page: 309
  ident: br000070
  article-title: Extremal connected graphs for independent domination number
  publication-title: Discrete Math.
– volume: 307
  start-page: 2643
  year: 2007
  end-page: 2646
  ident: br000325
  article-title: Upper bounds for independent domination in regular graphs
  publication-title: Discrete Math.
– volume: 38
  start-page: 119
  year: 1994
  end-page: 128
  ident: br000500
  article-title: Domination and independent domination numbers of graphs
  publication-title: Ars Combin.
– volume: 9
  start-page: 235
  year: 1993
  end-page: 237
  ident: br000390
  article-title: The independent domination number of a cubic 3-connected graph can be much larger than its domination number
  publication-title: Graphs Combin.
– volume: 34
  start-page: 277
  year: 2000
  end-page: 292
  ident: br000095
  article-title: A characterization of
  publication-title: J. Graph Theory
– volume: 188
  start-page: 261
  year: 1998
  end-page: 266
  ident: br000255
  article-title: On the independent domination number of graphs with given minimum degree
  publication-title: Discrete Math.
– year: 1998
  ident: br000335
  article-title: Domination in Graphs: Advanced Topics
– volume: 157
  start-page: 330
  year: 2009
  end-page: 338
  ident: br000405
  article-title: Fall colouring of bipartite graphs and Cartesian products of graphs
  publication-title: Discrete Appl. Math.
– volume: 159
  start-page: 1
  year: 1996
  end-page: 11
  ident: br000015
  article-title: Generalized domination and efficient domination in graphs
  publication-title: Discrete Math.
– volume: 172
  start-page: 149
  year: 2005
  end-page: 159
  ident: br000415
  article-title: Independent domatic partitioning or fall coloring of strongly chordal graphs
  publication-title: Congr. Numer.
– volume: 2
  start-page: 262
  year: 1964
  end-page: 272
  ident: br000495
  article-title: Independent sets in regular graphs
  publication-title: Israel J. Math.
– volume: 15
  start-page: 513
  year: 2006
  end-page: 522
  ident: br000170
  article-title: On the independent domination number of random regular graphs
  publication-title: Combin. Probab. Comput.
– volume: 52
  start-page: 33
  year: 2012
  end-page: 39
  ident: br000180
  article-title: The diameter of total domination and independent domination vertex-critical graphs
  publication-title: Australas. J. Combin.
– volume: 11
  start-page: 383
  year: 1988
  end-page: 398
  ident: br000445
  article-title: Generalised maximal independence and clique numbers of graphs
  publication-title: Quaest. Math.
– volume: 6
  start-page: 27
  year: 1993
  end-page: 28
  ident: br000295
  article-title: Independent domination in hypercubes
  publication-title: Appl. Math. Lett.
– volume: 6
  start-page: 400
  year: 1993
  end-page: 417
  ident: br000395
  article-title: Domination of cocomparability graphs
  publication-title: SIAM J. Discrete Math.
– volume: 38
  start-page: 364
  year: 1980
  end-page: 372
  ident: br000585
  article-title: Edge dominating sets in graphs
  publication-title: SIAM J. Appl. Math.
– volume: 9
  start-page: 30
  year: 1963
  end-page: 43
  ident: br000575
  article-title: The cartesian product of graphs
  publication-title: Vyčcisl. Sistemy
– volume: 31
  start-page: 163
  year: 1999
  end-page: 177
  ident: br000440
  article-title: Vertices contained in every minimum domination set of a tree
  publication-title: J. Graph Theory
– volume: 7
  start-page: 205
  year: 1991
  end-page: 208
  ident: br000020
  article-title: What is the difference between the domination and independent domination numbers of cubic graph?
  publication-title: Graphs Combin.
– volume: 16
  start-page: 189
  year: 1983
  end-page: 198
  ident: br000205
  article-title: A game related to covering by stars
  publication-title: Ars Combin.
– volume: 10
  start-page: 529
  year: 1997
  end-page: 550
  ident: br000535
  article-title: Algorithms for vertex partitioning problems on partial
  publication-title: SIAM J. Discrete Math.
– volume: 55
  start-page: 121
  year: 1986
  end-page: 150
  ident: br000290
  article-title: Characterization of trees with equal domination and independent domination numbers
  publication-title: Congr. Numer.
– volume: 27
  start-page: 85
  year: 1999
  end-page: 88
  ident: br000560
  article-title: 3-domination critical graphs with arbitrary independent domination numbers
  publication-title: Bull. Inst. Combin. Appl.
– volume: 143
  start-page: 275
  year: 1995
  end-page: 280
  ident: br000315
  article-title: Independent domination in regular graphs
  publication-title: Discrete Math.
– volume: 45
  start-page: 71
  year: 1984
  end-page: 82
  ident: br000470
  article-title: Linear algorithms for independent domination and total domination in series–parallel graphs
  publication-title: Congr. Numer.
– volume: 16
  start-page: 719
  year: 2012
  end-page: 732
  ident: br000270
  article-title: Independent domination in regular graphs
  publication-title: Ann. Comb.
– volume: 9
  start-page: 27
  year: 1984
  end-page: 39
  ident: br000135
  article-title: Clustering and domination in perfect graphs
  publication-title: Discrete Appl. Math.
– volume: 17
  start-page: 47
  year: 1993
  end-page: 51
  ident: br000235
  article-title: A note on the characterization of domination perfect graphs
  publication-title: J. Graph Theory
– volume: 87
  start-page: 205
  year: 2008
  end-page: 212
  ident: br000490
  article-title: On maximal fractional independent sets in graphs
  publication-title: Ars Combin.
– volume: 18
  start-page: 713
  year: 1994
  end-page: 721
  ident: br000215
  article-title: A characterization of well-covered graphs that contain neither 4- nor 5-cycles
  publication-title: J. Graph Theory
– reference: J. Southey, M.A. Henning, Domination versus independent domination in cubic graphs, Discrete Math., in press (
– year: 1862
  ident: br000150
  article-title: Traité des Applications de l’Analyse Mathématique au Jue des Échecs
– volume: 21
  start-page: 461
  year: 1978
  end-page: 468
  ident: br000120
  article-title: Properties of hereditary hypergraphs and middle graphs
  publication-title: Canad. Math. Bull.
– volume: 16
  start-page: 53
  year: 1996
  end-page: 79
  ident: br000450
  article-title: Associative graph products and their independence, domination and coloring numbers
  publication-title: Discuss. Math. Graph Theory
– volume: 23
  start-page: 73
  year: 1978
  end-page: 76
  ident: br000005
  article-title: On domination and independent domination numbers of a graph
  publication-title: Discrete Math.
– volume: X
  start-page: 471
  year: 1974
  end-page: 491
  ident: br000105
  article-title: Independence graphs
  publication-title: Congr. Numer.
– volume: 64
  start-page: 57
  year: 1996
  end-page: 65
  ident: br000300
  article-title: On 4-connected claw-free well-covered graphs
  publication-title: Discrete Appl. Math.
– year: 1979
  ident: br000240
  article-title: Computers and Intractability
– volume: 37
  start-page: 197
  year: 1991
  end-page: 200
  ident: br000375
  article-title: On approximating the minimum independent dominating set
  publication-title: Inform. Process. Lett.
– volume: 24
  start-page: 21
  year: 1997
  end-page: 23
  ident: br000185
  article-title: Extremal graphs with cliques and independent sets
  publication-title: J. Graph Theory
– volume: 1
  start-page: 134
  year: 1981/82
  end-page: 138
  ident: br000190
  article-title: Independent domination in chordal graphs
  publication-title: Oper. Res. Lett.
– volume: 21
  start-page: 147
  year: 2002
  end-page: 161
  ident: br000165
  article-title: Minimum independent dominating sets of random cubic graphs
  publication-title: Random Structures Algorithms
– volume: 7
  start-page: 86
  year: 2010
  end-page: 92
  ident: br000505
  article-title: Triangle-free graphs with large independent domination number
  publication-title: Discrete Optim.
– volume: 8
  start-page: 91
  year: 1970
  end-page: 98
  ident: br000475
  article-title: Some covering concepts in graphs
  publication-title: J. Combin. Theory
– volume: 260
  start-page: 77
  year: 2003
  end-page: 87
  ident: br000350
  article-title: Strong equality of domination parameters in trees
  publication-title: Discrete Math.
– volume: 2
  start-page: 20
  year: 1977
  end-page: 21
  ident: br000485
  article-title: Well-covered graphs
  publication-title: J. Combin. Inf. Syst. Sci.
– volume: 16
  start-page: 253
  year: 1993
  end-page: 287
  ident: br000480
  article-title: Well-covered graphs: a survey
  publication-title: Quaest. Math.
– volume: 306
  start-page: 2647
  year: 2006
  end-page: 2654
  ident: br000160
  article-title: Construction of trees and graphs with equal domination parameters
  publication-title: Discrete Math.
– volume: 5
  start-page: 128
  year: 1998
  end-page: 142
  ident: br000365
  article-title: Partitioning graphs into generalized dominating sets
  publication-title: Nordic J. Comput.
– volume: 15
  start-page: 277
  year: 1988
  end-page: 289
  ident: br000285
  article-title: A survey of the theory of hypercube graphs
  publication-title: Comput. Math. Appl.
– volume: 38
  start-page: 206
  year: 1962
  end-page: 212
  ident: br000455
  article-title: Theory of graphs
  publication-title: Amer. Math. Soc. Transl.
– volume: 306
  start-page: 2314
  year: 2006
  end-page: 2326
  ident: br000050
  article-title: Extremal graphs for a new upper bound on domination parameters in graphs
  publication-title: Discrete Math.
– volume: 222
  start-page: 151
  year: 2000
  end-page: 165
  ident: br000355
  article-title: Acyclic domination
  publication-title: Discrete Math.
– volume: 309
  start-page: 6451
  year: 2009
  end-page: 6458
  ident: br000370
  article-title: Remarks about disjoint dominating sets
  publication-title: Discrete Math.
– volume: 10
  start-page: 173
  year: 1991
  end-page: 182
  ident: br000130
  article-title: Independence and domination in 3-connected cubic graphs
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 305
  start-page: 18
  year: 2005
  end-page: 32
  ident: br000075
  article-title: Bicritical domination
  publication-title: Discrete Math.
– volume: 17
  start-page: 53
  year: 1983
  end-page: 56
  ident: br000140
  article-title: Perfect stables in graphs
  publication-title: Inform. Process. Lett.
– reference: S.M. Hedetniemi, S.T. Hedetniemi, R. Reynolds, Combinatorial problems on chessboards. II, in: Domination in Graphs [67], pp. 133–162.
– volume: 37
  start-page: 295
  year: 2007
  end-page: 300
  ident: br000225
  article-title: An improved lower bound for domination numbers of the queen’s graph
  publication-title: Australas. J. Combin.
– volume: 17
  start-page: 959
  year: 2004
  end-page: 962
  ident: br000425
  article-title: A note on connected bipartite graphs having independent domination number half their order
  publication-title: Appl. Math. Lett.
– volume: 10
  start-page: 389
  year: 1994
  end-page: 396
  ident: br000610
  article-title: Disproof of a conjecture in the domination theory
  publication-title: Graphs Combin.
– volume: 90
  start-page: 313
  year: 1991
  end-page: 317
  ident: br000090
  article-title: The product of the independent domination numbers of a graph and its complement
  publication-title: Discrete Math.
– volume: 308
  start-page: 3187
  year: 2008
  end-page: 3198
  ident: br000145
  article-title: -domination perfect trees
  publication-title: Discrete Math.
– volume: 70
  start-page: 17
  year: 1988
  end-page: 20
  ident: br000195
  article-title: Two relations between the parameters of independence and irredundance
  publication-title: Discrete Math.
– volume: 49
  start-page: 33
  year: 2004
  end-page: 55
  ident: br000420
  article-title: Bounds for the independent domination number of graphs and planar graphs
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 15
  start-page: 213
  year: 1976
  end-page: 222
  ident: br000115
  article-title: Disjoint independent dominating sets in graphs
  publication-title: Discrete Math.
– reference: , 2010.
– volume: 29
  start-page: 639
  year: 1980
  end-page: 656
  ident: br000435
  article-title: Strong independence in graphs
  publication-title: Congr. Numer.
– volume: XIX
  start-page: 321
  year: 1977
  end-page: 328
  ident: br000040
  article-title: Independent domination in trees
  publication-title: Congr. Numer.
– reference: A. Harutyunyan, P. Horn, J. Verstraete, Independent dominating sets in graphs of girth five, Manuscript:
– volume: 37
  start-page: 223
  year: 1994
  end-page: 233
  ident: br000025
  article-title: Some extremal results on independent distance domination in graphs
  publication-title: Ars Combin.
– volume: 86
  start-page: 33
  year: 1990
  end-page: 46
  ident: br000515
  article-title: Critical concepts in domination
  publication-title: Discrete Math.
– volume: 28
  start-page: 151
  year: 2008
  end-page: 163
  ident: br000045
  article-title: Maximal
  publication-title: Discuss. Math. Graph Theory
– volume: 39
  start-page: 109
  year: 1995
  end-page: 119
  ident: br000250
  article-title: Inequalities for total matchings of graphs
  publication-title: Ars Combin.
– volume: 310
  start-page: 1118
  year: 2010
  end-page: 1122
  ident: br000550
  article-title: Idomatic partitions of direct products of complete graphs
  publication-title: Discrete Math.
– volume: 26
  start-page: A-569
  year: 1979
  ident: br000525
  article-title: Domination perfect graphs
  publication-title: Notice Amer. Math. Soc.
– year: 1964
  ident: br000580
  article-title: Challenging Mathematical Problems with Elementary Solutions, Vol. I: Combinatorial Analysis and Probability Theory
– volume: 248
  start-page: 69
  year: 2002
  end-page: 77
  ident: br000345
  article-title: A characterization of
  publication-title: Discrete Math.
– volume: 22
  start-page: 9
  year: 1996
  end-page: 14
  ident: br000010
  article-title: Domination critical graphs with higher independent domination numbers
  publication-title: J. Graph Theory
– volume: 268
  start-page: 299
  year: 2003
  end-page: 302
  ident: br000265
  article-title: Nordhaus–Gaddum bounds for independent domination
  publication-title: Discrete Math.
– volume: 34
  start-page: 65
  year: 1983
  end-page: 76
  ident: br000520
  article-title: Domination critical graphs
  publication-title: J. Combin. Theory Ser. B
– volume: 23
  start-page: 273
  year: 1978
  end-page: 277
  ident: br000465
  article-title: Coverings by minimal transversals
  publication-title: Discrete Math.
– volume: 9
  start-page: 205
  year: 1993
  end-page: 207
  ident: br000595
  article-title: A counterexample to conjecture of Barefoot, Harary, and Jones
  publication-title: Graphs Combin.
– volume: 42
  start-page: 51
  year: 1993
  end-page: 63
  ident: br000380
  article-title: The complexity of domination problems in circle graphs
  publication-title: Discrete Appl. Math.
– volume: 202
  start-page: 135
  year: 1999
  end-page: 144
  ident: br000400
  article-title: On independent domination number of regular graphs
  publication-title: Discrete Math.
– volume: 76
  start-page: 240
  year: 1999
  end-page: 246
  ident: br000530
  article-title: An upper bound for the independent domination number
  publication-title: J. Combin. Theory Ser. B
– volume: 17
  start-page: 147
  year: 1997
  end-page: 153
  ident: br000060
  article-title: Generalized domination, independence and irredundance in graphs
  publication-title: Discuss. Math. Graph Theory
– volume: 3
  start-page: 241
  year: 1979
  end-page: 249
  ident: br000055
  article-title: Graph-theoretic parameters concerning domination, independence, and irredundance
  publication-title: J. Graph Theory
– reference: G.S. Domke, G.H. Fricke, R.R. Laskar, A. Majumdar, Fractional domination and related parameters, in: Domination in Graphs [67], pp. 61–89.
– year: 1998
  ident: br000340
  article-title: Fundamentals of Domination in Graphs
– volume: 262
  start-page: 159
  year: 2003
  end-page: 169
  ident: br000330
  article-title: -forming sets in graphs
  publication-title: Discrete Math.
– volume: 34
  start-page: 27
  year: 2002
  end-page: 38
  ident: br000230
  article-title: Excellent trees
  publication-title: Bull. Inst. Combin. Appl.
– year: 1992
  ident: br000565
  article-title: A Course in Combinatorics
– volume: 86
  start-page: 165
  year: 1990
  end-page: 177
  ident: br000085
  article-title: Unit disk graphs
  publication-title: Discrete Math.
– volume: 69
  start-page: 46
  year: 2012
  end-page: 76
  ident: br000065
  article-title: Vizing’s conjecture: a survey and recent results
  publication-title: J. Graph Theory
– volume: 1
  start-page: 19
  year: 1992
  end-page: 27
  ident: br000200
  article-title: A bound on the independent domination number of a tree
  publication-title: Vishwa Internat. J. Graph Theory
– volume: 7
  start-page: 247
  year: 1977
  end-page: 261
  ident: br000110
  article-title: Towards a theory of domination in graphs
  publication-title: Networks
– volume: 13
  start-page: 193
  year: 1993
  end-page: 212
  ident: br000080
  article-title: A characterization of well-covered cubic graphs
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 27
  start-page: 713
  year: 2011
  end-page: 726
  ident: br000385
  article-title: On idomatic partitions of direct products of complete graphs
  publication-title: Graphs Combin.
– volume: 8
  start-page: 19
  year: 2001
  ident: br000460
  article-title: Values of domination numbers of the queen’s graph
  publication-title: Electron. J. Combin.
– volume: 57
  start-page: 44
  year: 1993
  end-page: 68
  ident: br000210
  article-title: A characterization of well covered graphs of girth 5 or greater
  publication-title: J. Combin. Theory Ser. B
– volume: 24
  start-page: 239
  year: 2004
  end-page: 248
  ident: br000260
  article-title: Hereditary domination and independence parameters
  publication-title: Discuss. Math. Graph Theory
– volume: 33
  start-page: 99
  year: 1983
  end-page: 103
  ident: br000590
  article-title: Adomatic and idomatic numbers of graphs
  publication-title: Math. Slovaca
– year: 1973
  ident: br000035
  article-title: Graphs and Hypergraphs
– volume: 71
  start-page: 153
  year: 1990
  end-page: 172
  ident: br000280
  article-title: Fractional domination and fractional packing in graphs
  publication-title: Congr. Numer.
– volume: 33
  start-page: 257
  year: 2000
  end-page: 273
  ident: br000175
  article-title: Fall colorings of graphs
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 1/2
  start-page: 55
  year: 1990
  end-page: 66
  ident: br000545
  article-title: Well-covered and well-dominated block graphs and unicyclic graphs
  publication-title: Math. Pannon.
– volume: 122
  start-page: 89
  year: 1993
  end-page: 102
  ident: br000125
  article-title: The sequence of upper and lower domination, independence and irredundance numbers of a graph
  publication-title: Discrete Math.
– reference: L.C. van der Merwe, Total domination edge critical graphs, Ph.D. Thesis, University of South Africa, 1999.
– volume: 91
  start-page: 155
  year: 1999
  ident: 10.1016/j.disc.2012.11.031_br000430
  article-title: On the algorithmic complexity of twelve covering and independence parameters of graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(98)00147-4
– volume: 94
  start-page: 95
  year: 1991
  ident: 10.1016/j.disc.2012.11.031_br000310
  article-title: On minimum maximal independent sets of a graph
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(91)90318-V
– volume: 262
  start-page: 159
  year: 2003
  ident: 10.1016/j.disc.2012.11.031_br000330
  article-title: H-forming sets in graphs
  publication-title: Discrete Math.
  doi: 10.1016/S0012-365X(02)00496-X
– volume: 38
  start-page: 364
  year: 1980
  ident: 10.1016/j.disc.2012.11.031_br000585
  article-title: Edge dominating sets in graphs
  publication-title: SIAM J. Appl. Math.
  doi: 10.1137/0138030
– volume: 10
  start-page: 389
  year: 1994
  ident: 10.1016/j.disc.2012.11.031_br000610
  article-title: Disproof of a conjecture in the domination theory
  publication-title: Graphs Combin.
  doi: 10.1007/BF02986690
– volume: 3
  start-page: 241
  year: 1979
  ident: 10.1016/j.disc.2012.11.031_br000055
  article-title: Graph-theoretic parameters concerning domination, independence, and irredundance
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.3190030306
– volume: 86
  start-page: 33
  year: 1990
  ident: 10.1016/j.disc.2012.11.031_br000515
  article-title: Critical concepts in domination
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(90)90347-K
– volume: 42
  start-page: 51
  year: 1993
  ident: 10.1016/j.disc.2012.11.031_br000380
  article-title: The complexity of domination problems in circle graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/0166-218X(93)90178-Q
– volume: 28
  start-page: 151
  year: 2008
  ident: 10.1016/j.disc.2012.11.031_br000045
  article-title: Maximal k-independent sets in graphs
  publication-title: Discuss. Math. Graph Theory
  doi: 10.7151/dmgt.1398
– volume: 6
  start-page: 27
  year: 1993
  ident: 10.1016/j.disc.2012.11.031_br000295
  article-title: Independent domination in hypercubes
  publication-title: Appl. Math. Lett.
  doi: 10.1016/0893-9659(93)90027-K
– volume: 1/2
  start-page: 55
  year: 1990
  ident: 10.1016/j.disc.2012.11.031_br000545
  article-title: Well-covered and well-dominated block graphs and unicyclic graphs
  publication-title: Math. Pannon.
– volume: 21
  start-page: 461
  year: 1978
  ident: 10.1016/j.disc.2012.11.031_br000120
  article-title: Properties of hereditary hypergraphs and middle graphs
  publication-title: Canad. Math. Bull.
  doi: 10.4153/CMB-1978-079-5
– volume: 86
  start-page: 165
  year: 1990
  ident: 10.1016/j.disc.2012.11.031_br000085
  article-title: Unit disk graphs
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(90)90358-O
– volume: 10
  start-page: 529
  year: 1997
  ident: 10.1016/j.disc.2012.11.031_br000535
  article-title: Algorithms for vertex partitioning problems on partial k-trees
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/S0895480194275825
– volume: 1
  start-page: 19
  year: 1992
  ident: 10.1016/j.disc.2012.11.031_br000200
  article-title: A bound on the independent domination number of a tree
  publication-title: Vishwa Internat. J. Graph Theory
– volume: 11
  start-page: 383
  year: 1988
  ident: 10.1016/j.disc.2012.11.031_br000445
  article-title: Generalised maximal independence and clique numbers of graphs
  publication-title: Quaest. Math.
  doi: 10.1080/16073606.1988.9632153
– volume: 309
  start-page: 6451
  year: 2009
  ident: 10.1016/j.disc.2012.11.031_br000370
  article-title: Remarks about disjoint dominating sets
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2009.06.017
– volume: 159
  start-page: 1
  year: 1996
  ident: 10.1016/j.disc.2012.11.031_br000015
  article-title: Generalized domination and efficient domination in graphs
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(95)00094-D
– volume: 13
  start-page: 193
  year: 1993
  ident: 10.1016/j.disc.2012.11.031_br000080
  article-title: A characterization of well-covered cubic graphs
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 15
  start-page: 277
  issue: 4
  year: 1988
  ident: 10.1016/j.disc.2012.11.031_br000285
  article-title: A survey of the theory of hypercube graphs
  publication-title: Comput. Math. Appl.
  doi: 10.1016/0898-1221(88)90213-1
– year: 1998
  ident: 10.1016/j.disc.2012.11.031_br000335
– year: 1962
  ident: 10.1016/j.disc.2012.11.031_br000030
– volume: 17
  start-page: 53
  year: 1983
  ident: 10.1016/j.disc.2012.11.031_br000140
  article-title: Perfect stables in graphs
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(83)90091-1
– year: 1998
  ident: 10.1016/j.disc.2012.11.031_br000340
– volume: 16
  start-page: 189
  year: 1983
  ident: 10.1016/j.disc.2012.11.031_br000205
  article-title: A game related to covering by stars
  publication-title: Ars Combin.
– volume: 1
  start-page: 134
  year: 1981
  ident: 10.1016/j.disc.2012.11.031_br000190
  article-title: Independent domination in chordal graphs
  publication-title: Oper. Res. Lett.
  doi: 10.1016/0167-6377(82)90015-3
– volume: 21
  start-page: 147
  year: 2002
  ident: 10.1016/j.disc.2012.11.031_br000165
  article-title: Minimum independent dominating sets of random cubic graphs
  publication-title: Random Structures Algorithms
  doi: 10.1002/rsa.10047
– volume: 188
  start-page: 261
  year: 1998
  ident: 10.1016/j.disc.2012.11.031_br000255
  article-title: On the independent domination number of graphs with given minimum degree
  publication-title: Discrete Math.
  doi: 10.1016/S0012-365X(97)00267-7
– volume: 143
  start-page: 275
  year: 1995
  ident: 10.1016/j.disc.2012.11.031_br000315
  article-title: Independent domination in regular graphs
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(94)00022-B
– volume: 23
  start-page: 273
  year: 1978
  ident: 10.1016/j.disc.2012.11.031_br000465
  article-title: Coverings by minimal transversals
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(78)90075-4
– volume: 308
  start-page: 3545
  year: 2008
  ident: 10.1016/j.disc.2012.11.031_br000320
  article-title: Independent domination in triangle-free graphs
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2007.07.010
– ident: 10.1016/j.disc.2012.11.031_br000155
– volume: 17
  start-page: 959
  year: 2004
  ident: 10.1016/j.disc.2012.11.031_br000425
  article-title: A note on connected bipartite graphs having independent domination number half their order
  publication-title: Appl. Math. Lett.
  doi: 10.1016/j.aml.2003.09.006
– ident: 10.1016/j.disc.2012.11.031_br000510
  doi: 10.1016/j.disc.2012.01.003
– volume: 38
  start-page: 119
  year: 1994
  ident: 10.1016/j.disc.2012.11.031_br000500
  article-title: Domination and independent domination numbers of graphs
  publication-title: Ars Combin.
– volume: 15
  start-page: 513
  year: 2006
  ident: 10.1016/j.disc.2012.11.031_br000170
  article-title: On the independent domination number of random regular graphs
  publication-title: Combin. Probab. Comput.
  doi: 10.1017/S0963548305007431
– volume: 17
  start-page: 47
  year: 1993
  ident: 10.1016/j.disc.2012.11.031_br000235
  article-title: A note on the characterization of domination perfect graphs
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.3190170106
– volume: 5
  start-page: 128
  year: 1998
  ident: 10.1016/j.disc.2012.11.031_br000365
  article-title: Partitioning graphs into generalized dominating sets
  publication-title: Nordic J. Comput.
– year: 1862
  ident: 10.1016/j.disc.2012.11.031_br000150
– volume: 52
  start-page: 33
  year: 2012
  ident: 10.1016/j.disc.2012.11.031_br000180
  article-title: The diameter of total domination and independent domination vertex-critical graphs
  publication-title: Australas. J. Combin.
– volume: 49
  start-page: 33
  year: 2004
  ident: 10.1016/j.disc.2012.11.031_br000420
  article-title: Bounds for the independent domination number of graphs and planar graphs
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 260
  start-page: 77
  year: 2003
  ident: 10.1016/j.disc.2012.11.031_br000350
  article-title: Strong equality of domination parameters in trees
  publication-title: Discrete Math.
  doi: 10.1016/S0012-365X(02)00451-X
– volume: 307
  start-page: 2643
  year: 2007
  ident: 10.1016/j.disc.2012.11.031_br000325
  article-title: Upper bounds for independent domination in regular graphs
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2007.01.001
– volume: 138
  start-page: 199
  year: 1995
  ident: 10.1016/j.disc.2012.11.031_br000100
  article-title: On a Nordhaus–Gaddum type problem for independent domination
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(94)00202-T
– start-page: 301
  year: 1985
  ident: 10.1016/j.disc.2012.11.031_br000220
  article-title: On n-domination, n-dependence and forbidden subgraphs
– volume: 57
  start-page: 44
  year: 1993
  ident: 10.1016/j.disc.2012.11.031_br000210
  article-title: A characterization of well covered graphs of girth 5 or greater
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1006/jctb.1993.1005
– volume: 23
  start-page: 73
  year: 1978
  ident: 10.1016/j.disc.2012.11.031_br000005
  article-title: On domination and independent domination numbers of a graph
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(78)90105-X
– volume: 24
  start-page: 239
  year: 2004
  ident: 10.1016/j.disc.2012.11.031_br000260
  article-title: Hereditary domination and independence parameters
  publication-title: Discuss. Math. Graph Theory
  doi: 10.7151/dmgt.1228
– volume: 23
  start-page: 9
  year: 2012
  ident: 10.1016/j.disc.2012.11.031_br000275
  article-title: Independent dominating sets in triangle-free graphs
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-010-9336-4
– volume: 37
  start-page: 213
  year: 2001
  ident: 10.1016/j.disc.2012.11.031_br000410
  article-title: Independent perfect domination sets in Cayley graphs
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.1016
– volume: XIX
  start-page: 321
  year: 1977
  ident: 10.1016/j.disc.2012.11.031_br000040
  article-title: Independent domination in trees
  publication-title: Congr. Numer.
– volume: 31
  start-page: 163
  year: 1999
  ident: 10.1016/j.disc.2012.11.031_br000440
  article-title: Vertices contained in every minimum domination set of a tree
  publication-title: J. Graph Theory
  doi: 10.1002/(SICI)1097-0118(199907)31:3<163::AID-JGT2>3.0.CO;2-T
– volume: 37
  start-page: 197
  year: 1991
  ident: 10.1016/j.disc.2012.11.031_br000375
  article-title: On approximating the minimum independent dominating set
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(91)90188-N
– volume: 37
  start-page: 223
  year: 1994
  ident: 10.1016/j.disc.2012.11.031_br000025
  article-title: Some extremal results on independent distance domination in graphs
  publication-title: Ars Combin.
– volume: 76
  start-page: 240
  year: 1999
  ident: 10.1016/j.disc.2012.11.031_br000530
  article-title: An upper bound for the independent domination number
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1006/jctb.1999.1907
– volume: 20
  start-page: 193
  year: 1996
  ident: 10.1016/j.disc.2012.11.031_br000245
  article-title: Bounds on an independent distance domination parameter
  publication-title: J. Combin. Comput. Combin. Math.
– volume: 17
  start-page: 147
  year: 1997
  ident: 10.1016/j.disc.2012.11.031_br000060
  article-title: Generalized domination, independence and irredundance in graphs
  publication-title: Discuss. Math. Graph Theory
  doi: 10.7151/dmgt.1048
– volume: 172
  start-page: 149
  year: 2005
  ident: 10.1016/j.disc.2012.11.031_br000415
  article-title: Independent domatic partitioning or fall coloring of strongly chordal graphs
  publication-title: Congr. Numer.
– volume: 305
  start-page: 18
  year: 2005
  ident: 10.1016/j.disc.2012.11.031_br000075
  article-title: Bicritical domination
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2005.09.013
– volume: 8
  start-page: 19
  issue: 1
  year: 2001
  ident: 10.1016/j.disc.2012.11.031_br000460
  article-title: Values of domination numbers of the queen’s graph
  publication-title: Electron. J. Combin.
  doi: 10.37236/1573
– volume: 71
  start-page: 153
  year: 1990
  ident: 10.1016/j.disc.2012.11.031_br000280
  article-title: Fractional domination and fractional packing in graphs
  publication-title: Congr. Numer.
– volume: 7
  start-page: 247
  year: 1977
  ident: 10.1016/j.disc.2012.11.031_br000110
  article-title: Towards a theory of domination in graphs
  publication-title: Networks
  doi: 10.1002/net.3230070305
– volume: 6
  start-page: 400
  year: 1993
  ident: 10.1016/j.disc.2012.11.031_br000395
  article-title: Domination of cocomparability graphs
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/0406032
– volume: 310
  start-page: 1118
  year: 2010
  ident: 10.1016/j.disc.2012.11.031_br000550
  article-title: Idomatic partitions of direct products of complete graphs
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2009.10.012
– volume: 34
  start-page: 27
  year: 2002
  ident: 10.1016/j.disc.2012.11.031_br000230
  article-title: Excellent trees
  publication-title: Bull. Inst. Combin. Appl.
– volume: 37
  start-page: 295
  year: 2007
  ident: 10.1016/j.disc.2012.11.031_br000225
  article-title: An improved lower bound for domination numbers of the queen’s graph
  publication-title: Australas. J. Combin.
– volume: 10
  start-page: 173
  year: 1991
  ident: 10.1016/j.disc.2012.11.031_br000130
  article-title: Independence and domination in 3-connected cubic graphs
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 38
  start-page: 206
  year: 1962
  ident: 10.1016/j.disc.2012.11.031_br000455
  article-title: Theory of graphs
  publication-title: Amer. Math. Soc. Transl.
– volume: 308
  start-page: 3187
  year: 2008
  ident: 10.1016/j.disc.2012.11.031_br000145
  article-title: α-domination perfect trees
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2007.06.043
– volume: 24
  start-page: 21
  year: 1997
  ident: 10.1016/j.disc.2012.11.031_br000185
  article-title: Extremal graphs with cliques and independent sets
  publication-title: J. Graph Theory
  doi: 10.1002/(SICI)1097-0118(199701)24:1<21::AID-JGT3>3.0.CO;2-L
– volume: 9
  start-page: 27
  year: 1984
  ident: 10.1016/j.disc.2012.11.031_br000135
  article-title: Clustering and domination in perfect graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/0166-218X(84)90088-X
– ident: 10.1016/j.disc.2012.11.031_br000305
– volume: 2
  start-page: 262
  year: 1964
  ident: 10.1016/j.disc.2012.11.031_br000495
  article-title: Independent sets in regular graphs
  publication-title: Israel J. Math.
  doi: 10.1007/BF02759743
– volume: 7
  start-page: 86
  year: 2010
  ident: 10.1016/j.disc.2012.11.031_br000505
  article-title: Triangle-free graphs with large independent domination number
  publication-title: Discrete Optim.
  doi: 10.1016/j.disopt.2010.02.004
– volume: 39
  start-page: 109
  year: 1995
  ident: 10.1016/j.disc.2012.11.031_br000250
  article-title: Inequalities for total matchings of graphs
  publication-title: Ars Combin.
– volume: 222
  start-page: 151
  year: 2000
  ident: 10.1016/j.disc.2012.11.031_br000355
  article-title: Acyclic domination
  publication-title: Discrete Math.
  doi: 10.1016/S0012-365X(00)00012-1
– volume: 16
  start-page: 53
  year: 1996
  ident: 10.1016/j.disc.2012.11.031_br000450
  article-title: Associative graph products and their independence, domination and coloring numbers
  publication-title: Discuss. Math. Graph Theory
  doi: 10.7151/dmgt.1023
– volume: 55
  start-page: 121
  year: 1986
  ident: 10.1016/j.disc.2012.11.031_br000290
  article-title: Characterization of trees with equal domination and independent domination numbers
  publication-title: Congr. Numer.
– volume: 20
  start-page: 109
  year: 1991
  ident: 10.1016/j.disc.2012.11.031_br000600
  article-title: A characterization of domination perfect graphs
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.3190150202
– year: 1979
  ident: 10.1016/j.disc.2012.11.031_br000240
– volume: 18
  start-page: 713
  year: 1994
  ident: 10.1016/j.disc.2012.11.031_br000215
  article-title: A characterization of well-covered graphs that contain neither 4- nor 5-cycles
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.3190180707
– volume: 26
  start-page: A-569
  year: 1979
  ident: 10.1016/j.disc.2012.11.031_br000525
  article-title: Domination perfect graphs
  publication-title: Notice Amer. Math. Soc.
– volume: 27
  start-page: 85
  year: 1999
  ident: 10.1016/j.disc.2012.11.031_br000560
  article-title: 3-domination critical graphs with arbitrary independent domination numbers
  publication-title: Bull. Inst. Combin. Appl.
– volume: 122
  start-page: 89
  year: 1993
  ident: 10.1016/j.disc.2012.11.031_br000125
  article-title: The sequence of upper and lower domination, independence and irredundance numbers of a graph
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(93)90288-5
– volume: 7
  start-page: 205
  year: 1991
  ident: 10.1016/j.disc.2012.11.031_br000020
  article-title: What is the difference between the domination and independent domination numbers of cubic graph?
  publication-title: Graphs Combin.
  doi: 10.1007/BF01788145
– volume: 268
  start-page: 299
  year: 2003
  ident: 10.1016/j.disc.2012.11.031_br000265
  article-title: Nordhaus–Gaddum bounds for independent domination
  publication-title: Discrete Math.
  doi: 10.1016/S0012-365X(03)00032-3
– volume: 64
  start-page: 57
  year: 1996
  ident: 10.1016/j.disc.2012.11.031_br000300
  article-title: On 4-connected claw-free well-covered graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/0166-218X(94)00117-V
– ident: 10.1016/j.disc.2012.11.031_br000570
– volume: 202
  start-page: 135
  year: 1999
  ident: 10.1016/j.disc.2012.11.031_br000400
  article-title: On independent domination number of regular graphs
  publication-title: Discrete Math.
  doi: 10.1016/S0012-365X(98)00350-1
– volume: 69
  start-page: 46
  year: 2012
  ident: 10.1016/j.disc.2012.11.031_br000065
  article-title: Vizing’s conjecture: a survey and recent results
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.20565
– volume: 15
  start-page: 213
  year: 1976
  ident: 10.1016/j.disc.2012.11.031_br000115
  article-title: Disjoint independent dominating sets in graphs
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(76)90026-1
– year: 1964
  ident: 10.1016/j.disc.2012.11.031_br000580
– volume: 20
  start-page: 375
  year: 1995
  ident: 10.1016/j.disc.2012.11.031_br000605
  article-title: An induced subgraph characterization of domination perfect graphs
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.3190200313
– year: 1992
  ident: 10.1016/j.disc.2012.11.031_br000565
– volume: 33
  start-page: 257
  year: 2000
  ident: 10.1016/j.disc.2012.11.031_br000175
  article-title: Fall colorings of graphs
  publication-title: J. Combin. Math. Combin. Comput.
– volume: 16
  start-page: 253
  year: 1993
  ident: 10.1016/j.disc.2012.11.031_br000480
  article-title: Well-covered graphs: a survey
  publication-title: Quaest. Math.
  doi: 10.1080/16073606.1993.9631737
– volume: 2
  start-page: 20
  year: 1977
  ident: 10.1016/j.disc.2012.11.031_br000485
  article-title: Well-covered graphs
  publication-title: J. Combin. Inf. Syst. Sci.
– volume: 9
  start-page: 205
  year: 1993
  ident: 10.1016/j.disc.2012.11.031_br000595
  article-title: A counterexample to conjecture of Barefoot, Harary, and Jones
  publication-title: Graphs Combin.
  doi: 10.1007/BF02988308
– volume: 9
  start-page: 30
  year: 1963
  ident: 10.1016/j.disc.2012.11.031_br000575
  article-title: The cartesian product of graphs
  publication-title: Vyčcisl. Sistemy
– volume: 16
  start-page: 719
  year: 2012
  ident: 10.1016/j.disc.2012.11.031_br000270
  article-title: Independent domination in regular graphs
  publication-title: Ann. Comb.
  doi: 10.1007/s00026-012-0155-4
– volume: 27
  start-page: 713
  year: 2011
  ident: 10.1016/j.disc.2012.11.031_br000385
  article-title: On idomatic partitions of direct products of complete graphs
  publication-title: Graphs Combin.
  doi: 10.1007/s00373-010-0997-7
– volume: 22
  start-page: 9
  year: 1996
  ident: 10.1016/j.disc.2012.11.031_br000010
  article-title: Domination critical graphs with higher independent domination numbers
  publication-title: J. Graph Theory
  doi: 10.1002/(SICI)1097-0118(199605)22:1<9::AID-JGT2>3.0.CO;2-S
– volume: 248
  start-page: 69
  year: 2002
  ident: 10.1016/j.disc.2012.11.031_br000345
  article-title: A characterization of i-excellent trees
  publication-title: Discrete Math.
  doi: 10.1016/S0012-365X(01)00274-6
– volume: 8
  start-page: 91
  year: 1970
  ident: 10.1016/j.disc.2012.11.031_br000475
  article-title: Some covering concepts in graphs
  publication-title: J. Combin. Theory
  doi: 10.1016/S0021-9800(70)80011-4
– volume: 34
  start-page: 277
  year: 2000
  ident: 10.1016/j.disc.2012.11.031_br000095
  article-title: A characterization of (γ,i)-trees
  publication-title: J. Graph Theory
  doi: 10.1002/1097-0118(200008)34:4<277::AID-JGT4>3.0.CO;2-#
– volume: 87
  start-page: 205
  year: 2008
  ident: 10.1016/j.disc.2012.11.031_br000490
  article-title: On maximal fractional independent sets in graphs
  publication-title: Ars Combin.
– volume: X
  start-page: 471
  year: 1974
  ident: 10.1016/j.disc.2012.11.031_br000105
  article-title: Independence graphs
  publication-title: Congr. Numer.
– year: 1973
  ident: 10.1016/j.disc.2012.11.031_br000035
– volume: 34
  start-page: 65
  year: 1983
  ident: 10.1016/j.disc.2012.11.031_br000520
  article-title: Domination critical graphs
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1016/0095-8956(83)90007-2
– volume: 275
  start-page: 299
  year: 2004
  ident: 10.1016/j.disc.2012.11.031_br000070
  article-title: Extremal connected graphs for independent domination number
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2003.06.011
– volume: 306
  start-page: 2314
  year: 2006
  ident: 10.1016/j.disc.2012.11.031_br000050
  article-title: Extremal graphs for a new upper bound on domination parameters in graphs
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2005.12.029
– volume: 70
  start-page: 17
  year: 1988
  ident: 10.1016/j.disc.2012.11.031_br000195
  article-title: Two relations between the parameters of independence and irredundance
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(88)90076-3
– ident: 10.1016/j.disc.2012.11.031_br000555
– volume: 45
  start-page: 71
  year: 1984
  ident: 10.1016/j.disc.2012.11.031_br000470
  article-title: Linear algorithms for independent domination and total domination in series–parallel graphs
  publication-title: Congr. Numer.
– volume: 96
  start-page: 75
  year: 1991
  ident: 10.1016/j.disc.2012.11.031_br000540
  article-title: On graphs with equal domination and independent domination numbers
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(91)90473-F
– volume: 90
  start-page: 313
  year: 1991
  ident: 10.1016/j.disc.2012.11.031_br000090
  article-title: The product of the independent domination numbers of a graph and its complement
  publication-title: Discrete Math.
  doi: 10.1016/0012-365X(91)90151-Q
– volume: 33
  start-page: 99
  year: 1983
  ident: 10.1016/j.disc.2012.11.031_br000590
  article-title: Adomatic and idomatic numbers of graphs
  publication-title: Math. Slovaca
– ident: 10.1016/j.disc.2012.11.031_br000360
– volume: 29
  start-page: 639
  year: 1980
  ident: 10.1016/j.disc.2012.11.031_br000435
  article-title: Strong independence in graphs
  publication-title: Congr. Numer.
– volume: 157
  start-page: 330
  year: 2009
  ident: 10.1016/j.disc.2012.11.031_br000405
  article-title: Fall colouring of bipartite graphs and Cartesian products of graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2008.03.003
– volume: 306
  start-page: 2647
  year: 2006
  ident: 10.1016/j.disc.2012.11.031_br000160
  article-title: Construction of trees and graphs with equal domination parameters
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2006.04.031
– volume: 9
  start-page: 235
  year: 1993
  ident: 10.1016/j.disc.2012.11.031_br000390
  article-title: The independent domination number of a cubic 3-connected graph can be much larger than its domination number
  publication-title: Graphs Combin.
  doi: 10.1007/BF02988312
SSID ssj0001638
Score 2.4612362
Snippet A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 839
SubjectTerms Independent dominating
Title Independent domination in graphs: A survey and recent results
URI https://dx.doi.org/10.1016/j.disc.2012.11.031
Volume 313
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF5KvehBfGJ9lD14k7TJZneTCh5qsbRKe7KQW9hsNlApaWlSwYu_3Zk8qoL04CWQsAvZb5eZb5KZbwi5dQxnsaeVxR0OF18zK0J5bS9xNWNKO1rhB_3JVI5m_DkQQYMM6loYTKusbH9p0wtrXT3pVmh2V_M51viicogI8IcMMgmsYOcenvLO53eaB_KN0hozC0dXhTNljhdWvmJ6F-ugkqfr_O2cfjic4RE5rJgi7Zcvc0waJj0hB5OtzGp2Sh7G2ya2OY2XmNWCONN5Sgsh6uye9mm2Wb-bD6rSmMJKcSRE2JtFnp2R2fDpdTCyqn4IloYl5haTDEJK8OFKMi0Tk6jY9gzGtxKiQFeLnnI920uM50TA24wC9sBt4_aMw0Xs2-45aabL1FwQmhhXRAqVZ3yBbkz5XMDuCF9rpByyRZwaiFBXYuHYs2IR1llhbyGCFyJ4EEWEAF6L3G3nrEqpjJ2jRY1v-GvDQ7DlO-Zd_nPeFdlnRScLbtnymjTz9cbcAJ_Io3ZxYNpkrz9-GU3hbhw8fgHhY8hb
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8JAEJ4gHtSD8RnxuQdvptBud9ti4oEQCShwgoTbZtluEwwphBYTL_52d_pATQwHLz00u0n323bmm-7MNwD3jmY09JW0mMPMJVDUmqK8th-5ilKpHCXxh_5g6HXH7GXCJxVol7UwmFZZ2P7cpmfWurjTKNBsLGczrPFF5RA-wQMZZBI7sMvM54ttDOqf33keSDhyc0wtHF5UzuRJXlj6ivldtI5Snq7zt3f64XE6R3BYUEXSyp_mGCo6PoGDwUZnNTmFp96mi21KwgWmtSDQZBaTTIk6eSQtkqxX7_qDyDgkZqk40oTY63manMG48zxqd62iIYKlzBpTi3rUxJTGiUuPKi_SkQxtX2OA65kw0FW8KV3f9iPtO1ND3LQ09IHZ2m1qh_EwsN1zqMaLWF8AibTLpxKlZwKOfkwGjJvt4YFSyDm8GjglEEIVauHYtGIuyrSwN4HgCQTPhBHCgFeDh82cZa6VsXU0L_EVv3ZcGGO-Zd7lP-fdwV53NOiLfm_4egX7NGtrwSzbu4ZqulrrG0Mu0ult9vJ8AfrgyOU
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Independent+domination+in+graphs%3A+A+survey+and+recent+results&rft.jtitle=Discrete+mathematics&rft.au=Goddard%2C+Wayne&rft.au=Henning%2C+Michael+A.&rft.date=2013-04-06&rft.pub=Elsevier+B.V&rft.issn=0012-365X&rft.eissn=1872-681X&rft.volume=313&rft.issue=7&rft.spage=839&rft.epage=854&rft_id=info:doi/10.1016%2Fj.disc.2012.11.031&rft.externalDocID=S0012365X13000083
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0012-365X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0012-365X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0012-365X&client=summon