Domination for Latin Square Graphs

Pahlavsay, Behnaz; Palezzato, Elisa; Torielli, Michele

Graphs and combinatorics, 2021, 37, 971-985

Permalink : https://hdl.handle.net/2115/84577

このアイテムのアクセス数:341件（2026-02-10 11:19 集計）

ファイル	フォーマット	サイズ	閲覧回数	説明
Graphs Comb.37_971-985	pdf	325 KB	345

アクセス権	open access
URI	https://hdl.handle.net/2115/84577
タイトル	Domination for Latin Square Graphs
著者	Pahlavsay, Behnaz ; Palezzato, Elisa ; Torielli, Michele
著者名 Pahlavsay, Behnaz
著者名 Palezzato, Elisa
著者名 Torielli, Michele
言語	英語
キーワード	Latin square graph
	Domination
	k-Tuple total domination
	Latin square
	Transversal
発行日	2021-03-29
出版者	Springer
収録物名	Graphs and combinatorics
巻(号)	37
ページ	971-985
抄録	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.
資源タイプ	学術雑誌論文
出版タイプ	Accepted Manuscript
権利情報	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.
PISSN	0911-0119
関連情報 (isVersionOf)	出版社版DOI https://doi.org/10.1007/s00373-021-02297-7