I am a Ph.D. student in the Department of Mathematics and Statistics at the University of Victoria (Victoria, British Colombia, Canada). I am currently working under the co-supervision of Dr. Gary MacGillivray and Dr. Kieka Mynhardt.
Prior to coming to UVic, I completed my M.Sc. degree in the Department of Mathematics and Statistics at the Université de Montréal (Montreal, Quebec, Canada) where I worked under the co-supervision of Dr. Geňa Hahn and Dr. Ben Seamone.
I completed my B.Sc. degree in the Department of Applied Mathematics at National Chiao Tung University (Hsinchu City, Taiwan, R.O.C).
My research interests lie in "Discrete Mathematics", particularly in the intersection of "Graph Theory", "Combinatorial Game Theory" and "Computational Complexity Theory".
Many real world problems can be modelled using combinatorial games played on graphs between some given sets of players. Examples of such games include (but are not limited to):
- The "Eternal Domination Game", where one player controls a set of guards who must move along the edges of a graph in order to respond to some sequence of attacks on the vertices of the graph.
- The "Cops and Robbers Game", where one player controls a set of cops who must move along the edges of a graph in order to capture a robber located somewhere in the graph.
- The "Firefighter Problem", where one player controls a set of firefighters who must contain a fire that is spreading in a graph.
These games are often used as mathematical models for problems that occur on complex networks such as the spread of infectious diseases, computer viruses, misinformation as well as various types of network security or surveillance problems.
I am a member of the Discrete Mathematics group in the Department of Mathematics and Statistics at the University of Victoria.
Here is a list of my publications (starting with the most recent in each section).
- Fnu Devvrit, Aaron Krim-Yee, Nithish Kumar, Gary MacGillivray, Ben Seamone, Virgélot Virgile and AnQi Xu. Fractional eternal domination: securely distributing resources across a network.
- Devvrit Khatri, Natasha Komarov, Aaron Krim-Yee, Nithish Kumar, Ben Seamone, Virgélot Virgile and AnQi Xu. A study of cops and robbers in oriented graphs. PDF
- Gary MacGillivray, C. M. Mynhardt and Virgélot Virgile, Eternal Domination and Clique Covering, Electronic Journal of Graph Theory and Applications, vol. 10 no. 2 (2022), pages 603–624. PDF
- Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Zacarías, Ben Seamone and Virgélot Virgile. A method for eternally dominating strong grids. Discrete Mathematics and Theoretical Computer Science (DMTCS), vol. 22 no. 1 (2020), pages 1-11. PDF
- Aaron Krim-Yee, Ben Seamone and Virgélot Virgile, Eternal domination on prisms of graphs, Discrete Applied Mathematics, vol. 283 (2020), pages 734-736. PDF
- Virgélot Virgile. Domination éternelle dans les graphes. Master's Thesis, Université de Montréal (2019). PDF
|University of Victoria|
Mathematics and Statistics
3800 Finnerty Road
Victoria BC V8P 5C2
|Office: DTB A534|