Combinatorial batch codes were defined by Paterson, Stinson, and Wei as purely combinatorial versions of the batch codes introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai. There are n items andâ€¦ (More)

We define the cyclic matching sequencibility of a graph to be the largest integer d such that there exists a cyclic ordering of its edges so that every d consecutive edges in the cyclic ordering formâ€¦ (More)

Article history: Received 14 April 2011 Accepted 1 March 2012 Available online xxxx Submitted by N. Shaked-Monderer In admiration, to Avi Berman, Moshe Goldberg, and Raphi Loewy AMS classification:â€¦ (More)

We briefly review known results about the signed edge domination number of graphs. In the case of bipartite graphs, the signed edge domination number can be viewed in terms of its bi-adjacencyâ€¦ (More)

In the spirit of the light switching game of Gale and Berlekamp, we define a light switching game based on permutations. We consider the game over the integers modulo k, that is, with light bulbs inâ€¦ (More)

For t a positive integer, the t-term rank of a (0, 1)-matrix A is defined to be the largest number of 1s in A with at most one 1 in each column and at most t 1s in each row. Thus the 1-term rank isâ€¦ (More)