Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
From MaRDI portal
Publication:2009004
DOI10.1016/j.dam.2019.08.004zbMath1428.05229OpenAlexW2973403019MaRDI QIDQ2009004
Sibel Özkan, Cafer Caliskan, Štefko Miklavič
Publication date: 27 November 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.08.004
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Efficient domination in Cayley graphs of generalized dihedral groups ⋮ Domination in rose window graphs ⋮ Distance-regular graphs admitting a perfect 1-code
Cites Work
- On perfect codes in Cartesian products of graphs
- Efficient domination in circulant graphs with two chord lengths
- Efficient dominating sets in Cayley graphs.
- Dominating Cartesian products of cycles
- Independent perfect domination sets in Cayley graphs
- Rose window graphs
- A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups