최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기Discrete applied mathematics, v.235, 2018년, pp.23 - 50
Bonomo, Flavia (Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computació) , Brešar, Boštjan (n, Buenos Aires, Argentina) , Grippo, Luciano N. (Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia) , Milanič, Martin (Instituto de Ciencias, Universidad Nacional de General Sarmiento, Los Polvorines, Buenos Aires, Argentina) , Safe, Martín D. (University of Primorska, UP IAM, Muzejski trg 2, SI-6000 Koper, Slovenia)
Abstract In this paper, we study the most basic domination invariants in graphs, in which number 2 is intrinsic part of their definitions. We classify them upon three criteria, two of which give the following previously studied invariants: the weak 2 -domination number, γ w 2 ...
Acharya vol. 13 1 2010 Advances in Discrete Mathematics and Applications: Mysore, 2008 Domination in hypergraphs II. New directions
Australas. J. Combin. Adabi 52 11 2012 Properties of independent Roman domination in graphs
Int. J. Contemp. Math. Sci. Anusuya 7 41-44 2099 2012 A note on disjoint dominating sets in graphs
Bull. Malays. Math. Sci. Soc. (2) Aram 36 1 39 2013 On the total {k}-domination and total {k}-domatic number of graphs
Ausiello xx+524 1999 Complexity and Approximation
J. Appl. Math. Comput. Barman 43 1-2 133 2013 10.1007/s12190-013-0656-2 Minimum 2-tuple dominating set of permutation graphs
Blidia 61 2007 Graph Theory in Paris Ratios of some domination parameters in graphs and claw-free graphs
Taiwanese J. Math. Bre?ar 10 5 1317 2006 10.11650/twjm/1500557305 On integer domination in graphs and Vizing-like problems
Taiwanese J. Math. Bre?ar 12 1 213 2008 10.11650/twjm/1500602498 Rainbow domination in graphs
Discrete Appl. Math. Bre?ar 155 17 2394 2007 10.1016/j.dam.2007.07.018 On the 2-rainbow domination in graphs
Australas. J. Combin. Caro 59 1 2014 Degree sequence index strategy
Discrete Appl. Math. Chang 161 10-11 1395 2013 10.1016/j.dam.2013.01.024 Rainbow domination and related problems on strongly chordal graphs
Discrete Appl. Math. Chang 158 1 8 2010 10.1016/j.dam.2009.08.010 Rainbow domination on trees
Discrete Appl. Math. Chellali 178 27 2014 10.1016/j.dam.2014.06.016 Bounds on weak roman and 2-rainbow domination numbers
Australas. J. Combin. Chellali 56 85 2013 On 2-rainbow domination and Roman domination in graphs
Discuss. Math. Graph Theory Chellali 25 3 291 2005 10.7151/dmgt.1282 Exact double domination in graphs
Inform. and Comput. Chlebik 206 11 1264 2008 10.1016/j.ic.2008.07.003 Approximation hardness of dominating set problems in bounded degree graphs
Discrete Math. Choudhary 338 7 1239 2015 10.1016/j.disc.2015.01.032 Integer domination of Cartesian product graphs
Discrete Appl. Math. Cicalese 161 6 750 2013 10.1016/j.dam.2012.10.007 On the approximability and exact algorithms for vector domination and related problems in graphs
Discrete Math. Cockayne 278 1-3 11 2004 10.1016/j.disc.2003.06.004 Roman domination in graphs
Networks Cockayne 7 3 247 1977 10.1002/net.3230070305 Towards a theory of domination in graphs
Appl. Math. Lett. DeLaVina 24 6 996 2011 10.1016/j.aml.2011.01.013 Bounds on the k-domination number of a graph
Util. Math. Desormeaux 91 131 2013 Double domination in complementary prisms
Dinur 624 2014 Proceedings of the 2014 ACM Symposium on Theory of Computing Analytical approach to parallel repetition
Math. Oper. Res. Dobson 7 4 515 1982 10.1287/moor.7.4.515 Worst-case analysis of greedy heuristics for integer programming with nonnegative data
Domke 371 1991 Graph Theory, Combinatorics, and Applications, Vol. 1 (Kalamazoo, MI, 1988) Relationships between integer and fractional parameters of graphs
J. Comb. Optim. Dorbec 27 4 688 2014 10.1007/s10878-012-9547-y Paired versus double domination in K1,r-free graphs
Dreyer Jr. 178 2000 Applications and Variations of Domination in Graphs
J. Graph Theory Favaron 57 1 33 2008 10.1002/jgt.20279 On k-domination and minimum degree in graphs
J. ACM Feige 45 4 634 1998 10.1145/285055.285059 A threshold of lnn for approximating set cover
Int. J. Comput. Math. Fernau 85 1 25 2008 10.1080/00207160701374376 Roman domination: a parameterized perspective
Fink 283 1985 Graph Theory with Applications To Algorithms and Computer Science (Kalamazoo, Mich., 1984) n-domination in graphs
Canad. J. Math. Foldes 29 3 666 1977 10.4153/CJM-1977-069-1 Split graphs having Dilworth number two
Discrete Appl. Math. Fujita 161 6 806 2013 10.1016/j.dam.2012.10.017 Difference between 2-rainbow domination and Roman domination in graphs
Discrete Appl. Math. Furuya 184 229 2015 10.1016/j.dam.2014.11.002 A note on total domination and 2-rainbow domination in graphs
Gairing vol. 2704 49 2003 Self-Stabilizing Systems Self-Stabilizing algorithms for {k}-domination
Magyar Tud. Akad. Mat. Fiz. Oszt. Kozl. Gallai 7 305 1957 Grafokkal kapcsolatos maximum-minimum tetelek (I. resz)
Magyar Tud. Akad. Mat. Fiz. Oszt. Kozl. Gallai 8 1 1958 Grafokkal kapcsolatos maximum-minimum tetelek (II. resz)
Acta Math. Acad. Sci. Hungar. Gallai 9 395 1958 10.1007/BF02020271 Maximum-minimum satze uber graphen
Ann. Univ. Sci. Budapest. Eotvos Sect. Math. Gallai 2 133 1959 Uber extreme punkt- und kantenmengen
Garey x+338 1979 Computers and Intractability A guide to the theory of NP-completeness
Discrete Appl. Math. Hansberg 161 10-11 1472 2013 10.1016/j.dam.2013.02.008 On k-domination and j-independence in graphs
Discrete Math. Harary 155 1-3 99 1996 10.1016/0012-365X(94)00373-Q Nordhaus-Gaddum inequalities for domination in graphs
Ars Combin. Harary 55 201 2000 Double domination in graphs
Discuss. Math. Graph Theory Hartnell 24 3 389 2004 10.7151/dmgt.1238 On dominating the Cartesian product of a graph and K2
vol. 209 xiv+497 1998 Domination in Graphs. Advanced Topics
vol. 208 xii+446 1998 Fundamentals of Domination in Graphs
Networks Haynes 32 3 199 1998 10.1002/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F Paired-domination in graphs
Hedetniemi vol. 7 87 2008 Discrete Mathematics Disjoint dominating sets in graphs
Congr. Numer. Hedetniemi 217 129 2013 Few compare to the great Roman empire
Discrete Math. Henning 266 1-3 239 2003 10.1016/S0012-365X(02)00811-7 Defending the Roman Empire-a new strategy
Discrete Appl. Math. Henning 158 9 1006 2010 10.1016/j.dam.2010.01.009 k-tuple total domination in graphs
Discrete Math. Henning 309 23-24 6451 2009 10.1016/j.disc.2009.06.017 Remarks about disjoint dominating sets
SIAM J. Discrete Math. Henning 24 4 1336 2010 10.1137/090777001 Strong transversals in hypergraphs and double total domination in graphs
European J. Combin. Henning 34 7 1192 2013 10.1016/j.ejc.2013.04.005 2-colorings in k-regular k-uniform hypergraphs
Henning xiv+178 2013 Total Domination in Graphs
Discrete Math. Hou 309 10 3413 2009 10.1016/j.disc.2008.07.030 On the {k}-domination number of Cartesian products of graphs
Discrete Math. John 313 3 217 2013 10.1016/j.disc.2012.10.008 Graph products and integer domination
Appl. Anal. Discrete Math. Jose 3 2 347 2009 10.2298/AADM0902347J Hypergraph domination and strong independence
Inform. Process. Lett. Klasing 89 2 75 2004 10.1016/j.ipl.2003.10.004 Hardness results and approximation algorithms of k-tuple domination in graphs
Houston J. Math. Krzywkowski 39 2 427 2013 On trees with double domination number equal to 2-domination number plus one
Int. J. Adv. Res. Comput. Sci. Technol. Kulli 2 1 106 2014 Inverse domination and inverse total domination in digraphs
J. Comb. Optim. Li 18 2 173 2009 10.1007/s10878-008-9144-2 On the total {k}-domination number of Cartesian products of graphs
SIAM J. Discrete Math. Liu 26 1 193 2012 10.1137/080733085 Roman domination on 2-connected graphs
J. Comb. Optim. Liu 26 3 608 2013 10.1007/s10878-012-9482-y Roman domination on strongly chordal graphs
Graphs Combin. Lowenstein 26 3 407 2010 10.1007/s00373-010-0918-9 Pairs of disjoint dominating sets and the minimum degree of graphs
Electron. J. Combin. Pavli 19 3 37 2012 10.37236/2595 Roman domination number of the Cartesian products of paths and cycles
Discrete Appl. Math. Pilipczuk 160 16-17 2484 2012 10.1016/j.dam.2012.06.011 Some results on Vizing’s conjecture and related problems
Inform. Process. Lett. Pradhan 112 21 816 2012 10.1016/j.ipl.2012.07.010 Algorithmic aspects of k-tuple total domination in graphs
Australas. J. Combin. Rad 51 49 2011 Critical concept for 2-rainbow domination in graphs
Discrete Math. Sampathkumar 161 1-3 235 1996 10.1016/0012-365X(95)00231-K Strong weak domination and domination balance in a graph
Schrijver vol. 24 2003 Combinatorial Optimization. Polyhedra and Efficiency (3 Volumes)
Discrete Math. Algorithms Appl. Shang 2 1 99 2010 10.1142/S1793830910000504 Roman domination and its variants in unit disk graphs
Inform. Sci. Shao 254 225 2014 10.1016/j.ins.2013.07.020 On rainbow domination numbers of graphs
Sci. Am. Stewart 281 136 1999 10.1038/scientificamerican1299-136 Defend the roman empire!
Discrete Appl. Math. ?umenjak 161 13-14 2133 2013 10.1016/j.dam.2013.03.011 Rainbow domination in the lexicographic product of graphs
Vazirani xx+378 2001 Approximation Algorithms
Combinatorica Wolsey 2 4 385 1982 10.1007/BF02579435 An analysis of the greedy algorithm for the submodular set covering problem
Appl. Math. Lett. Wu 23 6 706 2010 10.1016/j.aml.2010.02.012 Note on 2-rainbow domination and Roman domination in graphs
Math. Slovaca Zelinka 38 3 207 1988 Total domatic number of cacti
Zelinka vol. 209 351 1998 Domination in Graphs Domatic numbers of graphs and their variants: a survey
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
저자가 공개 리포지터리에 출판본, post-print, 또는 pre-print를 셀프 아카이빙 하여 자유로운 이용이 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.