2012/10/30 by Andrew M. Steane, Steane, Andrew M.
Computer Science · Mathematics · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO
paper · pdf · doi:10.48550/arxiv.1210.7985
18 pages; 11 figures
arxiv created 2012/10/30 · arxiv updated 2012/10/31
The notions of captured/lost vertices and dead edges in the Shannon game (Shannon switching game on nodes) are examined using graph theory. Simple methods are presented for identifying some dead edges and some captured sets of vertices, thus simplifying the (computationally hard) problem of analyzing the game.