|
Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Science / Faculty of Science >
Peer-reviewed Journal Articles, etc >
Domination for Latin Square Graphs
| Title: | Domination for Latin Square Graphs |
| Authors: | Pahlavsay, Behnaz Browse this author | | Palezzato, Elisa Browse this author | | Torielli, Michele Browse this author |
| Keywords: | Latin square graph | | Domination | | k-Tuple total domination | | Latin square | | Transversal |
| Issue Date: | 29-Mar-2021 |
| Publisher: | Springer |
| Journal Title: | Graphs and combinatorics |
| Volume: | 37 |
| Start Page: | 971 |
| End Page: | 985 |
| Publisher DOI: | 10.1007/s00373-021-02297-7 |
| Abstract: | In combinatorics, a latin square is a n x 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. |
| Rights: | This is a post-peer-review, pre-copyedit version of an article published in Graphs and Combinatorics. The final authenticated version is available online at: https://doi.org/10.1007/s00373-021-02297-7. |
| Type: | article (author version) |
| URI: | http://hdl.handle.net/2115/84577 |
| Appears in Collections: | 理学院・理学研究院 (Graduate School of Science / Faculty of Science) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
|
Submitter: TORIELLI Michele
|
