$\require{mediawiki-texvc}$

연합인증

연합인증 가입 기관의 연구자들은 소속기관의 인증정보(ID와 암호)를 이용해 다른 대학, 연구기관, 서비스 공급자의 다양한 온라인 자원과 연구 데이터를 이용할 수 있습니다.

이는 여행자가 자국에서 발행 받은 여권으로 세계 각국을 자유롭게 여행할 수 있는 것과 같습니다.

연합인증으로 이용이 가능한 서비스는 NTIS, DataON, Edison, Kafe, Webinar 등이 있습니다.

한번의 인증절차만으로 연합인증 가입 서비스에 추가 로그인 없이 이용이 가능합니다.

다만, 연합인증을 위해서는 최초 1회만 인증 절차가 필요합니다. (회원이 아닐 경우 회원 가입이 필요합니다.)

연합인증 절차는 다음과 같습니다.

최초이용시에는
ScienceON에 로그인 → 연합인증 서비스 접속 → 로그인 (본인 확인 또는 회원가입) → 서비스 이용

그 이후에는
ScienceON 로그인 → 연합인증 서비스 접속 → 서비스 이용

연합인증을 활용하시면 KISTI가 제공하는 다양한 서비스를 편리하게 이용하실 수 있습니다.

Domination parameters with number 2 : Interrelations and algorithmic consequences

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 AI-Helper 아이콘AI-Helper

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 ...

주제어

참고문헌 (81)

  1. Acharya vol. 13 1 2010 Advances in Discrete Mathematics and Applications: Mysore, 2008 Domination in hypergraphs II. New directions 

  2. Australas. J. Combin. Adabi 52 11 2012 Properties of independent Roman domination in graphs 

  3. Int. J. Contemp. Math. Sci. Anusuya 7 41-44 2099 2012 A note on disjoint dominating sets in graphs 

  4. Bull. Malays. Math. Sci. Soc. (2) Aram 36 1 39 2013 On the total {k}-domination and total {k}-domatic number of graphs 

  5. Ausiello xx+524 1999 Complexity and Approximation 

  6. J. Appl. Math. Comput. Barman 43 1-2 133 2013 10.1007/s12190-013-0656-2 Minimum 2-tuple dominating set of permutation graphs 

  7. Blidia 61 2007 Graph Theory in Paris Ratios of some domination parameters in graphs and claw-free graphs 

  8. Taiwanese J. Math. Bre?ar 10 5 1317 2006 10.11650/twjm/1500557305 On integer domination in graphs and Vizing-like problems 

  9. Taiwanese J. Math. Bre?ar 12 1 213 2008 10.11650/twjm/1500602498 Rainbow domination in graphs 

  10. Discrete Appl. Math. Bre?ar 155 17 2394 2007 10.1016/j.dam.2007.07.018 On the 2-rainbow domination in graphs 

  11. Australas. J. Combin. Caro 59 1 2014 Degree sequence index strategy 

  12. 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 

  13. Discrete Appl. Math. Chang 158 1 8 2010 10.1016/j.dam.2009.08.010 Rainbow domination on trees 

  14. Discrete Appl. Math. Chellali 178 27 2014 10.1016/j.dam.2014.06.016 Bounds on weak roman and 2-rainbow domination numbers 

  15. Australas. J. Combin. Chellali 56 85 2013 On 2-rainbow domination and Roman domination in graphs 

  16. Discuss. Math. Graph Theory Chellali 25 3 291 2005 10.7151/dmgt.1282 Exact double domination in graphs 

  17. 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 

  18. Discrete Math. Choudhary 338 7 1239 2015 10.1016/j.disc.2015.01.032 Integer domination of Cartesian product graphs 

  19. 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 

  20. Discrete Math. Cockayne 278 1-3 11 2004 10.1016/j.disc.2003.06.004 Roman domination in graphs 

  21. Networks Cockayne 7 3 247 1977 10.1002/net.3230070305 Towards a theory of domination in graphs 

  22. Appl. Math. Lett. DeLaVina 24 6 996 2011 10.1016/j.aml.2011.01.013 Bounds on the k-domination number of a graph 

  23. Util. Math. Desormeaux 91 131 2013 Double domination in complementary prisms 

  24. Dinur 624 2014 Proceedings of the 2014 ACM Symposium on Theory of Computing Analytical approach to parallel repetition 

  25. 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 

  26. Domke 371 1991 Graph Theory, Combinatorics, and Applications, Vol. 1 (Kalamazoo, MI, 1988) Relationships between integer and fractional parameters of graphs 

  27. J. Comb. Optim. Dorbec 27 4 688 2014 10.1007/s10878-012-9547-y Paired versus double domination in K1,r-free graphs 

  28. Dreyer Jr. 178 2000 Applications and Variations of Domination in Graphs 

  29. J. Graph Theory Favaron 57 1 33 2008 10.1002/jgt.20279 On k-domination and minimum degree in graphs 

  30. J. ACM Feige 45 4 634 1998 10.1145/285055.285059 A threshold of lnn for approximating set cover 

  31. Int. J. Comput. Math. Fernau 85 1 25 2008 10.1080/00207160701374376 Roman domination: a parameterized perspective 

  32. Fink 283 1985 Graph Theory with Applications To Algorithms and Computer Science (Kalamazoo, Mich., 1984) n-domination in graphs 

  33. Canad. J. Math. Foldes 29 3 666 1977 10.4153/CJM-1977-069-1 Split graphs having Dilworth number two 

  34. 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 

  35. 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 

  36. Gairing vol. 2704 49 2003 Self-Stabilizing Systems Self-Stabilizing algorithms for {k}-domination 

  37. Magyar Tud. Akad. Mat. Fiz. Oszt. Kozl. Gallai 7 305 1957 Grafokkal kapcsolatos maximum-minimum tetelek (I. resz) 

  38. Magyar Tud. Akad. Mat. Fiz. Oszt. Kozl. Gallai 8 1 1958 Grafokkal kapcsolatos maximum-minimum tetelek (II. resz) 

  39. Acta Math. Acad. Sci. Hungar. Gallai 9 395 1958 10.1007/BF02020271 Maximum-minimum satze uber graphen 

  40. Ann. Univ. Sci. Budapest. Eotvos Sect. Math. Gallai 2 133 1959 Uber extreme punkt- und kantenmengen 

  41. Garey x+338 1979 Computers and Intractability A guide to the theory of NP-completeness 

  42. Discrete Appl. Math. Hansberg 161 10-11 1472 2013 10.1016/j.dam.2013.02.008 On k-domination and j-independence in graphs 

  43. Discrete Math. Harary 155 1-3 99 1996 10.1016/0012-365X(94)00373-Q Nordhaus-Gaddum inequalities for domination in graphs 

  44. Ars Combin. Harary 55 201 2000 Double domination in graphs 

  45. Discuss. Math. Graph Theory Hartnell 24 3 389 2004 10.7151/dmgt.1238 On dominating the Cartesian product of a graph and K2 

  46. vol. 209 xiv+497 1998 Domination in Graphs. Advanced Topics 

  47. vol. 208 xii+446 1998 Fundamentals of Domination in Graphs 

  48. 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 

  49. Hedetniemi vol. 7 87 2008 Discrete Mathematics Disjoint dominating sets in graphs 

  50. Congr. Numer. Hedetniemi 217 129 2013 Few compare to the great Roman empire 

  51. Discrete Math. Henning 266 1-3 239 2003 10.1016/S0012-365X(02)00811-7 Defending the Roman Empire-a new strategy 

  52. Discrete Appl. Math. Henning 158 9 1006 2010 10.1016/j.dam.2010.01.009 k-tuple total domination in graphs 

  53. Discrete Math. Henning 309 23-24 6451 2009 10.1016/j.disc.2009.06.017 Remarks about disjoint dominating sets 

  54. SIAM J. Discrete Math. Henning 24 4 1336 2010 10.1137/090777001 Strong transversals in hypergraphs and double total domination in graphs 

  55. European J. Combin. Henning 34 7 1192 2013 10.1016/j.ejc.2013.04.005 2-colorings in k-regular k-uniform hypergraphs 

  56. Henning xiv+178 2013 Total Domination in Graphs 

  57. Discrete Math. Hou 309 10 3413 2009 10.1016/j.disc.2008.07.030 On the {k}-domination number of Cartesian products of graphs 

  58. Discrete Math. John 313 3 217 2013 10.1016/j.disc.2012.10.008 Graph products and integer domination 

  59. Appl. Anal. Discrete Math. Jose 3 2 347 2009 10.2298/AADM0902347J Hypergraph domination and strong independence 

  60. 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 

  61. Houston J. Math. Krzywkowski 39 2 427 2013 On trees with double domination number equal to 2-domination number plus one 

  62. Int. J. Adv. Res. Comput. Sci. Technol. Kulli 2 1 106 2014 Inverse domination and inverse total domination in digraphs 

  63. 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 

  64. SIAM J. Discrete Math. Liu 26 1 193 2012 10.1137/080733085 Roman domination on 2-connected graphs 

  65. J. Comb. Optim. Liu 26 3 608 2013 10.1007/s10878-012-9482-y Roman domination on strongly chordal graphs 

  66. Graphs Combin. Lowenstein 26 3 407 2010 10.1007/s00373-010-0918-9 Pairs of disjoint dominating sets and the minimum degree of graphs 

  67. Electron. J. Combin. Pavli 19 3 37 2012 10.37236/2595 Roman domination number of the Cartesian products of paths and cycles 

  68. 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 

  69. Inform. Process. Lett. Pradhan 112 21 816 2012 10.1016/j.ipl.2012.07.010 Algorithmic aspects of k-tuple total domination in graphs 

  70. Australas. J. Combin. Rad 51 49 2011 Critical concept for 2-rainbow domination in graphs 

  71. Discrete Math. Sampathkumar 161 1-3 235 1996 10.1016/0012-365X(95)00231-K Strong weak domination and domination balance in a graph 

  72. Schrijver vol. 24 2003 Combinatorial Optimization. Polyhedra and Efficiency (3 Volumes) 

  73. Discrete Math. Algorithms Appl. Shang 2 1 99 2010 10.1142/S1793830910000504 Roman domination and its variants in unit disk graphs 

  74. Inform. Sci. Shao 254 225 2014 10.1016/j.ins.2013.07.020 On rainbow domination numbers of graphs 

  75. Sci. Am. Stewart 281 136 1999 10.1038/scientificamerican1299-136 Defend the roman empire! 

  76. Discrete Appl. Math. ?umenjak 161 13-14 2133 2013 10.1016/j.dam.2013.03.011 Rainbow domination in the lexicographic product of graphs 

  77. Vazirani xx+378 2001 Approximation Algorithms 

  78. Combinatorica Wolsey 2 4 385 1982 10.1007/BF02579435 An analysis of the greedy algorithm for the submodular set covering problem 

  79. 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 

  80. Math. Slovaca Zelinka 38 3 207 1988 Total domatic number of cacti 

  81. Zelinka vol. 209 351 1998 Domination in Graphs Domatic numbers of graphs and their variants: a survey 

관련 콘텐츠

오픈액세스(OA) 유형

GREEN

저자가 공개 리포지터리에 출판본, post-print, 또는 pre-print를 셀프 아카이빙 하여 자유로운 이용이 가능한 논문

섹션별 컨텐츠 바로가기

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

AI-Helper 아이콘
AI-Helper
안녕하세요, AI-Helper입니다. 좌측 "선택된 텍스트"에서 텍스트를 선택하여 요약, 번역, 용어설명을 실행하세요.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.

선택된 텍스트