Regular sets of generalized Petersen graphs
From MaRDI portal
Cites work
- A NOTE ON REGULAR SETS IN CAYLEY GRAPHS
- An overview of \((\kappa, \tau)\)-regular sets and their applications
- Characterizing subgroup perfect codes by 2-subgroups
- Classification of efficient dominating sets of circulant graphs of degree 5
- Efficient dominating sets in circulant graphs
- Efficient dominating sets in circulant graphs with domination number prime
- Efficient domination in circulant graphs with two chord lengths
- Efficient open domination in Cayley graphs
- Existence of efficient total dominating sets of circulant graphs of degree 4
- Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
- On perfect 2-colorings of Johnson graphs \(J(v, 3)\)
- On regular sets in Cayley graphs
- On regular sets in Cayley sum graphs
- On subgroup perfect codes in Cayley graphs
- On subgroup perfect codes in Cayley sum graphs
- On subgroup regular sets in Cayley sum graphs
- On the domination number of the generalized Petersen graphs
- On the subgroup regular sets in Cayley graphs
- Perfect 2-colorings of the generalized Petersen graph
- Perfect 2-colorings of the generalized Petersen graph \(GP(n,3)\)
- Perfect 2-colorings of the Johnson graph \(J(9, 4)\)
- Perfect 2‐colorings of Hamming graphs
- Perfect codes in Cayley graphs
- Perfect codes in circulant graphs
- Perfect codes in graphs
- Perfect codes in vertex-transitive graphs
- Regular sets in Cayley graphs
- Regular sets in circulant graphs with degree 3
- Subgroup Perfect Codes in Cayley Graphs
- Subgroup regular sets in Cayley graphs
- Total perfect codes in Cayley graphs
- Vertex domination of generalized Petersen graphs
This page was built for publication: Regular sets of generalized Petersen graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7353757)
