Domination for Latin square graphs

DOI10.1007/s00373-021-02297-7zbMath1470.05129arXiv1911.10673OpenAlexW3150840881MaRDI QIDQ2045392

Michele Torielli, Behnaz Pahlavsay, Elisa Palezzato

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

Latin squaretransversaldomination\(k\)-tuple total dominationLatin square graph

Mathematics Subject Classification ID

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

Related Items (5)

Total domination number of middle graphs ⋮ Total dominator coloring number of middle graphs ⋮ Unnamed Item ⋮ Domination in Chessboards ⋮ Middle domination and 2-independence in trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(k\)-tuple total domination in graphs
• Diagonally cyclic Latin squares.
• Latin squares with maximal partial transversals of many lengths
• Covers and partial transversals of Latin squares
• Strongly regular graphs, partial geometries and partially balanced designs

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