2019/11/25 by Pahlavsay, Behnaz, Palezzato, Elisa, Torielli, Michele
#05B15 #05C30 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1911.10673
In combinatorics, a latin square is a n× n matrix filled with n different symbols, each occurring exactly once in each row and exactly once in each column. Associated to each latin square, we can define a simple graph called a latin square graph. In this article, we compute lower and upper bounds for the domination number and the k-tuple total domination numbers of such graphs. Moreover, we describe a formula for the 2-tuple total domination number.