Independent perfect domination sets in semi-Cayley graphs
From MaRDI portal
Publication:2039694
DOI10.1007/978-3-030-57602-8_39zbMath1482.05264OpenAlexW3048210351MaRDI QIDQ2039694
Xiaomeng Wang, Xianyue Li, Shou-Jun Xu
Publication date: 5 July 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_39
Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Subgroups as efficient dominating sets in Cayley graphs
- Efficient dominating sets in circulant graphs with domination number prime
- Efficient dominating sets in circulant graphs
- Efficient domination in circulant graphs with two chord lengths
- The spectrum of semi-Cayley graphs over abelian groups
- Strongly regular semi-Cayley graphs
- Efficient domination in circulant graphs
- Independent perfect domination sets in Cayley graphs
- Enumeration of Regular Graph Coverings Having Finite Abelian Covering Transformation Groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Independent perfect domination sets in semi-Cayley graphs