Greedy Defining Sets in Latin Squares

Manouchehr Zaker1
1 Institute for Advanced Studies in Basic Sciences 45195-1159, Zanjan – Iran

Abstract

Greedy defining sets have been studied for the first time by the author for graphs. In this paper, we consider greedy defining sets for Latin squares and study the structure of these sets in Latin squares. We give a general bound for greedy defining numbers and linear bounds for greedy defining numbers of some infinite families of Latin squares. Greedy defining sets of circulant Latin squares are also discussed in the paper.