当前位置:
X-MOL 学术
›
Graphs Comb.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Domination for Latin Square Graphs
Graphs and Combinatorics ( IF 0.6 ) Pub Date : 2021-03-29 , DOI: 10.1007/s00373-021-02297-7 Behnaz Pahlavsay , Elisa Palezzato , Michele Torielli
中文翻译:
拉丁方图的统治
更新日期:2021-03-30
Graphs and Combinatorics ( IF 0.6 ) Pub Date : 2021-03-29 , DOI: 10.1007/s00373-021-02297-7 Behnaz Pahlavsay , Elisa Palezzato , Michele Torielli
In combinatorics, a latin square is a \(n\times 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.
中文翻译:
拉丁方图的统治
在组合语中,拉丁方是一个\(n × n \)矩阵,其中填充有n个不同的符号,每个符号在每一行中发生一次,在每一列中发生一次。与每个拉丁方相关联,我们可以定义一个简单的图,称为拉丁方图。在本文中,我们计算此类图的支配数和k元组总支配数的上限和下限。此外,我们描述了2元组总控制数的公式。