دانشگاه شهید مدنی آذربایجان

 آمار

تعداد نشریات7
تعداد شماره‌ها104
تعداد مقالات1,152
تعداد مشاهده مقاله1,061,030
تعداد دریافت فایل اصل مقاله889,112
Dominic, Charles, Witkowski, Łukasz, Witkowski, Marcin. (1402). Cop-edge critical generalized Petersen and Paley graphs. , 8(2), 359-378. doi: 10.22049/cco.2022.27308.1229
Charles Dominic; Łukasz Witkowski; Marcin Witkowski. "Cop-edge critical generalized Petersen and Paley graphs". , 8, 2, 1402, 359-378. doi: 10.22049/cco.2022.27308.1229
Dominic, Charles, Witkowski, Łukasz, Witkowski, Marcin. (1402). 'Cop-edge critical generalized Petersen and Paley graphs', , 8(2), pp. 359-378. doi: 10.22049/cco.2022.27308.1229
Dominic, Charles, Witkowski, Łukasz, Witkowski, Marcin. Cop-edge critical generalized Petersen and Paley graphs. , 1402; 8(2): 359-378. doi: 10.22049/cco.2022.27308.1229

Cop-edge critical generalized Petersen and Paley graphs

Communications in Combinatorics and Optimization
مقاله 6، دوره 8، شماره 2، شهریور 2023، صفحه 359-378    اصل مقاله (410.33 K)
نوع مقاله: Original paper
شناسه دیجیتال (DOI): 10.22049/cco.2022.27308.1229
نویسندگان
Charles Dominic1؛ Łukasz Witkowski2؛ Marcin Witkowski* 2
1HRIST (Deemed to be university), Bengaluru-560029, Karnataka
2Adam Mickiewicz University, Poznan, Poland
چکیده
Cop Robber game is a two player game played on an undirected graph. In this game, the cops try to capture a robber moving on the vertices of the graph. The cop number of a graph is the least number of cops needed to guarantee that the robber will be caught. We study textit{cop-edge critical} graphs, i.e. graphs $G$ such that for any edge $e$ in $E(G)$ either $c(G-e)< c(G)$ or $c(G-e)>c(G)$. In this article, we study the edge criticality of generalized Petersen graphs and Paley graphs. 
کلیدواژه‌ها
Cops and Robbers؛ vertex-pursuit games؛ Petersen graphs؛ Paley graphs
مراجع
[1] M. Aigner and M. Fromme, A game of cops and robbers, Discrete Appl. Math. 8 (1984), no. 1, 1–12.

[2] W. Ananchuen and L. Caccetta, On the adjacency properties of Paley graphs, Networks 23 (1993), no. 4, 227–236.

[3] W. Ananchuen, L. Caccetta, and W. Australia, On graphs satisfying a strong adacency property, Australas. J. Combin. 8 (1993), 153–168.

[4] W. Baird, A. Beveridge, P. Codenotti, A. Maurer, J. McCauley, and S. Valeva, On the minimum order of $k$-cop-win graphs, Contrib. Discrete Math. 9, no. 1, 70–84.

[5] T. Ball, R.W. Bell, J. Guzman, M. Hanson-Colvin, and N. Schonsheck, On the cop number of generalized Petersen graphs, Discrete Math. 340 (2017), no. 6, 1381–1388.

[6] J. Beck, Combinatorial Games: Tic-Tac-Toe Theory (encyclopedia of mathematics and its applications), vol. 114, Cambridge University Press, Cambridge, 2008.

[7] A. Bonato and R.J. Nowakowski, The Game of Cops and Robbers on Graphs, American Mathematical Soc., 2011.

[8] L. Caccetta, P. Erdös, and K. Vijayan, A property of random graphs, Ars Combin. 19 (1985), 287–294.

[9] D.M. Cardoso, C. Dominic, Ł. Witkowski, and M. Witkowski, On cops and robbers on GΞ and cop-edge critical graphs, Contrib. Discrete Math. 12, no. 2, 167–186.

[10] H.S.M. Coxeter, R. Frucht, and D.L. Powers, Zero-symmetric graphs: Trivalent graphical regular representations of groups, Academic Press, 2014.

[11] F. Harary, Graph Theory, Addison-Wesley, Reading, MA., 1969.

[12] R. Nowakowski and P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Math. 43 (1983), no. 2-3, 235–239.

آمار
تعداد مشاهده مقاله: 492
تعداد دریافت فایل اصل مقاله: 948


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب