آمار
| تعداد نشریات | 5 |
| تعداد شماره‌ها | 114 |
| تعداد مقالات | 1,297 |
| تعداد مشاهده مقاله | 1,282,005 |
| تعداد دریافت فایل اصل مقاله | 1,127,411 |
Total outer-convex domination number of graphs | ||
| Communications in Combinatorics and Optimization | ||
| مقاله 6، دوره 7، شماره 1، شهریور 2022، صفحه 59-68 اصل مقاله (521.55 K) | ||
| نوع مقاله: Original paper | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2021.27141.1203 | ||
| نویسندگان | ||
| Rubelyn Yangyang؛ Marylin Tarongoy؛ Evangelyn Revilla؛ Rona Mae Banlasan؛ Jonecis A Dayap* | ||
| University of San Jose-Recoletos | ||
| چکیده | ||
| In this paper, we initiate the study of total outer-convex domination as a new variant of graph domination and we show the close relationship that exists between this novel parameter and other domination parameters of a graph such as total domination, convex domination, and outer-convex domination. Furthermore, we obtain general bounds of total outer-convex domination number and, for some particular families of graphs, we obtain closed formulas. | ||
| کلیدواژه‌ها | ||
| Domination number؛ total domination number؛ convex domination؛ total outer-convex domination number؛ grid graphs | ||
| مراجع | ||
|
[1] H. Abdollahzadeh Ahangar, F. Fujie-Okamoto, and V. Samodivkin, On the forcing connected geodetic number and the connected geodetic number of a graph, Ars Combin. 126 (2016), 323–335.
[2] H. Abdollahzadeh Ahangar, S. Kosari, S.M. Sheikholeslami, and L. Volkmann, Graphs with large geodetic number, Filomat 29 (2015), no. 6, 1361–1368.
[3] H. Abdollahzadeh Ahangar and M. Najimi, Total restrained geodetic number of graphs, Iran. J. Sci. Technol. Trans. A Sci. 41 (2017), no. 2, 473–480.
[4] H. Abdollahzadeh Ahangar, V. Samodivkin, S.M. Sheikholeslami, and A. Khodkar, The restrained geodetic number of a graph, Bull. Malays. Math. Sci. Soc. 38 (2015), no. 3, 1143–1155.
[5] G. Chartrand and P. Zhang, Convex sets in graphs, Congr. Numer. 136 (1999), 19–32.
[6] J.A. Dayap, R. Alcantara, and R. Anoos, Outer-weakly convex domination number of graphs, Commun. Comb. Optim. 5 (2020), no. 2, 207–215.
[7] J.A. Dayap and E.L. Enriquez, Outer-convex domination in graphs, Discrete Math. Algorithms Appl. 12 (2020), no. 1, Article ID. 2050008.
[8] P. Gupta, Domination in graph with application, Indian J. Res. 2 (2013), no. 3, 115–117.
[9] F. Harary and J. Nieminen, Convexity in graphs, J. Differ Geom. 16 (1981), no. 2, 185–190.
[10] S.T. Hedetniemi and R.C. Laskar, Topics on domination, Elsevier, 1991.
[11] Z. Shao, S. Kosari, R. Anoos, S.M. Sheikholeslami, and J.A. Dayap, Outer-convex dominating set in the corona of graphs as encryption key generator, Complexity 2020 (2020), Article ID. 8316454. | ||
|
آمار تعداد مشاهده مقاله: 818 تعداد دریافت فایل اصل مقاله: 684 |
||