On the guessing number of shift graphs

DOI10.1016/j.jda.2008.09.009zbMath1184.68365OpenAlexW2004159513MaRDI QIDQ1026230

Søren Riis, Taoyang Wu, Peter J. Cameron

Publication date: 24 June 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.09.009

zbMATH Keywords

network codingshift graphguessing number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Guessing numbers and extremal graph theory ⋮ Finite Dynamical Systems, Hat Games, and Coding Theory ⋮ Bears with hats and independence polynomials ⋮ The linear guessing number of undirected graphs ⋮ The three colour hat guessing game on cycle graphs ⋮ Guessing numbers of odd cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Information flows, graphs and their guessing numbers
• Reversible and Irreversible Information Networks
• Communication Complexity
• Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis “Utilising Public Information in Network Coding”

This page was built for publication: On the guessing number of shift graphs