Domination for Latin Square Graphs

Behnaz Pahlavsay; Elisa Palezzato; Michele Torielli

doi:10.1007/s00373-021-02297-7

Domination for Latin Square Graphs

Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

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.

Original language	English (US)
Pages (from-to)	971-985
Number of pages	15
Journal	Graphs and Combinatorics
Volume	37
Issue number	3
DOIs	https://doi.org/10.1007/s00373-021-02297-7
State	Published - May 2021
Externally published	Yes

Keywords

Domination
k-Tuple total domination
Latin square
Latin square graph
Transversal

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1007/s00373-021-02297-7

Cite this

@article{a85b397e5c50456a9b1374f90fb08707,

title = "Domination for Latin Square Graphs",

abstract = "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.",

keywords = "Domination, k-Tuple total domination, Latin square, Latin square graph, Transversal",

author = "Behnaz Pahlavsay and Elisa Palezzato and Michele Torielli",

note = "Publisher Copyright: {\textcopyright} 2021, The Author(s), under exclusive licence to Springer Japan KK, part of Springer Nature.",

year = "2021",

month = may,

doi = "10.1007/s00373-021-02297-7",

language = "English (US)",

volume = "37",

pages = "971--985",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "3",

}

TY - JOUR

T1 - Domination for Latin Square Graphs

AU - Pahlavsay, Behnaz

AU - Palezzato, Elisa

AU - Torielli, Michele

PY - 2021/5

Y1 - 2021/5

N2 - 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.

AB - 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.

KW - Domination

KW - k-Tuple total domination

KW - Latin square

KW - Latin square graph

KW - Transversal

UR - http://www.scopus.com/inward/record.url?scp=85103387010&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85103387010&partnerID=8YFLogxK

U2 - 10.1007/s00373-021-02297-7

DO - 10.1007/s00373-021-02297-7

M3 - Article

AN - SCOPUS:85103387010

SN - 0911-0119

VL - 37

SP - 971

EP - 985

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 3

ER -

Domination for Latin Square Graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this