On domination number of Latin square graphs of finite cyclic groups
From MaRDI portal
Publication:5859500
DOI10.1142/S1793830920500901zbMath1458.05045OpenAlexW3042232195WikidataQ113268558 ScholiaQ113268558MaRDI QIDQ5859500
Mohammadreza Sorouhesh, Sara Pouyandeh, Maryam Golriz, Maryam Khademi
Publication date: 16 April 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830920500901
Association schemes, strongly regular graphs (05E30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items (2)
Notes on Latin square graphs and their domination numbers ⋮ Minimum Dominating Set for the Prism Graph Family
Cites Work
- The chromatic number of finite group Cayley tables
- Strongly regular graphs, partial geometries and partially balanced designs
- On the chromatic number of Latin square graphs
- Small latin squares, quasigroups, and loops
- Towards a theory of domination in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On domination number of Latin square graphs of finite cyclic groups