Efficient domination in cubic vertex-transitive graphs
From MaRDI portal
Publication:449200
DOI10.1016/J.EJC.2012.04.007zbMATH Open1248.05141OpenAlexW2041212854MaRDI QIDQ449200FDOQ449200
Authors: Martin Knor, Primož Potočnik 
Publication date: 12 September 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2012.04.007
Recommendations
- scientific article; zbMATH DE number 15376
- Vertex-edge domination in cubic graphs
- On domination in connected cubic graphs
- Total domination versus domination in cubic graphs
- Efficient domination in circulant graphs
- Domination in Cubic Graphs of Large Girth
- Efficient total domination in digraphs
- Domination and total domination in cubic graphs of large girth
- Efficient total dominating sets in Cayley graphs
- Domination and irredundance in cubic graphs
[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=M%EF%BF%BD%EF%BF%BDbius+ladder&go=Go M��bius ladder]connected cubic vertex-transitive graph
Cites Work
- Title not available (Why is that?)
- Perfect codes in graphs
- Title not available (Why is that?)
- Perfect domination in regular grid graphs
- Lifting graph automorphisms by voltage assignments
- An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
- Title not available (Why is that?)
- Elementary abelian covers of graphs
- A contribution to the theory of voltage graphs
- Efficient dominating sets in Cayley graphs.
- Independent perfect domination sets in Cayley graphs
- On perfect codes in Cartesian products of graphs
- Efficient domination in circulant graphs with two chord lengths
- Vertex-transitive graphs: Symmetric graphs of prime valency
- Minimum fractional dominating functions and maximum fractional packing functions
- The bondage numbers and efficient dominations of vertex-transitive graphs
- Title not available (Why is that?)
- Cubic vertex-transitive graphs on up to 1280 vertices
- Title not available (Why is that?)
- An almost complete description of perfect codes in direct products of cycles
Cited In (18)
- Domination in rose window graphs
- Efficient dominating sets in circulant graphs with domination number prime
- Efficient domination in Cayley graphs of generalized dihedral groups
- Efficient absorbants in generalized de Bruijn digraphs
- On efficient absorbant conjecture in generalized de Bruijn digraphs
- Total perfect codes in graphs realized by commutative rings
- The (non-)existence of perfect codes in Fibonacci cubes
- Title not available (Why is that?)
- Total perfect codes in Cayley graphs
- Perfect codes in circulant graphs
- Packings in bipartite prisms and hypercubes
- Globally optimal joint image segmentation and shape matching based on Wasserstein modes
- On the order of vertex-stabilisers in vertex-transitive graphs with local group \(\mathrm{C}_p \times \mathrm{C}_p\) or \(\mathrm{C}_p\, \mathrm{wr}\, \mathrm{C}_2\)
- Perfect codes in vertex-transitive graphs
- Constructing the minimum dominating sets of generalized de Bruijn digraphs
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- Efficient closed domination in digraph products
- Efficient dominating sets in circulant graphs
This page was built for publication: Efficient domination in cubic vertex-transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449200)
