Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
W.H. Chan
Dept. of Mathematics and Information Technology, The Hong Kong Institute of Education, Hong Kong
Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Notes on the combinatorial game: graph Nim Richard M. Low; W.H. Chan
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 4, No 2 (2016): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2016.4.2.7

Abstract

The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on graphs have been proposed and studied by N.J. Calkin et al., L.A. Erickson and M. Fukuyama. In this paper, we focus on the version of Nim played on graphs which was introduced by N.J. Calkin et al.: Two players alternate turns, each time choosing a vertex $v$ of a finite graph and removing any number $(\geq 1)$ of edges incident to $v$. The player who cannot make a move loses the game. Here, we analyze Graph Nim for various classes of graphs and also compute some Grundy-values.
Co-Authors Richard M. Low