Home/International Journal of Combinatorics/Article Record
Peer-Reviewed Article August 28, 2016

Combinatorial Analysis of a Subtraction Game on Graphs

Are you an author of this work?Link to your sovereign AfriScholar profile
Published in: International Journal of Combinatorics
Publisher: Hindawi Publishing Corporation • Egypt • 1687-9163
DOI: https://doi.org/10.1155/2016/1476359

Abstract

We define a two-player combinatorial game in which players take alternate turns; each turn consists of deleting a vertex of a graph, together with all the edges containing such vertex. If any vertex became isolated by a player’s move then it would also be deleted. A player wins the game when the other player has no moves available. We study this game under various viewpoints: by finding specific strategies for certain families of graphs, through using properties of a graph’s automorphism group, by writing a program to look at Sprague-Grundy numbers, and by studying the game when played on random graphs. When analyzing Grim played on paths, using the Sprague-Grundy function, we find a connection to a standing open question about Octal games.

Download Full Text PDFView at PublisherCrossref RecordCrossref XML

Verified Citation Velocity

Recorded scholarly citations in African and international peer-reviewed literature

9
Total Citations

Citations are continuously tracked and harvested across continental OJS endpoints and OpenAlex feeds.