Domination for Latin square graphs

DOI10.1007/S00373-021-02297-7MaRDI QIDQ2045392zbMATH OpenOpenAlexFDO

Authors Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli

Publication date 12 August 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.10673

zbMATH Keywords

\(k\)-tuple total dominationdominationLatin squareLatin square graphtransversal

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Graph designs and isomorphic decomposition (05C51) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Transversal (matching) theory (05D15)

Abstract: In combinatorics, a latin square is a $nimesn$ 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.

Recommendations

• Notes on Latin square graphs and their domination numbers
• On domination number of Latin square graphs of finite cyclic groups
• Latin squares
• On the chromatic number of Latin square graphs
• 3-tuple total domination number of Rook's graphs

Cites work

• k-tuple total domination in graphs
• Covers and partial transversals of Latin squares
• Diagonally cyclic Latin squares.
• Graph theory
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1792607 (Why is no real title available?)
• Latin squares with maximal partial transversals of many lengths
• Strongly regular graphs, partial geometries and partially balanced designs

Cited in

(10)

• Domination in chessboards
• Middle domination and 2-independence in trees
• Domination number of middle graphs
• Total domination number of middle graphs
• Notes on Latin square graphs and their domination numbers
• On domination number of Latin square graphs of finite cyclic groups
• EXISTENCE OF LATIN SQUARE DESIGNS ARISING FROM CLASSICAL GRAPH PARAMETERS B. CHALUVARAJU AND SHAIKH AMEER BASHA
• Total dominator coloring number of middle graphs
• On the total domination number of total graphs
• A reinforced system for the Playfair cipher by incorporating dominator coloring in Latin square graphs

This page was built for publication: Domination for Latin square graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045392)