On the guessing number of shift graphs

https://doi.org/10.1016/j.jda.2008.09.009Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper we investigate guessing number, a relatively new concept linked to network coding and certain long standing open questions in circuit complexity. Here we study the bounds and a variety of properties concerning this parameter. As an application, we obtain the lower and upper bounds for shift graphs, a subclass of directed circulant graphs.

Keywords

Guessing number
Shift graph
Network coding

Cited by (0)