Affiliation:
1. Department of Mathematics, South Tehran Branch, Islamic Azad University, Tehran, Iran
Abstract
This paper aims to find certain bounds for the domination number of Latin square graphs, i.e., a simple graph assigned to a Latin square. In fact, we show that if [Formula: see text] is a Latin square of order [Formula: see text] and [Formula: see text] is the associated Latin square graph of [Formula: see text], then [Formula: see text]. We will investigate in which case the equalities hold. Finally, we study the domination number of Latin square graph associated to groups. In particular, we show that if [Formula: see text], then [Formula: see text]. Also, we prove that if [Formula: see text], then [Formula: see text].
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Stability of certified domination upon edge addition;Discrete Mathematics, Algorithms and Applications;2023-09-05
2. Variants of the domination number for flower snarks;Ars Mathematica Contemporanea;2023-07-31
3. Minimum Dominating Set for the Prism Graph Family;Mathematics in Applied Sciences and Engineering;2023-03-22
4. Notes on Latin square graphs and their domination numbers;Discrete Mathematics, Algorithms and Applications;2021-06-21