Efficient domination in cubic vertex-transitive graphs

DOI10.1016/j.ejc.2012.04.007zbMath1248.05141OpenAlexW2041212854MaRDI QIDQ449200

Primož Potočnik, Martin Knor

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

zbMATH Keywords

Möbius ladderconnected cubic vertex-transitive graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (18)

Efficient domination in Cayley graphs of generalized dihedral groups ⋮ Total perfect codes in Cayley graphs ⋮ Globally optimal joint image segmentation and shape matching based on Wasserstein modes ⋮ Efficient dominating sets in circulant graphs with domination number prime ⋮ Efficient closed domination in digraph products ⋮ Perfect codes in vertex-transitive graphs ⋮ 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\) ⋮ Packings in bipartite prisms and hypercubes ⋮ Domination in rose window graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ Efficient dominating sets in circulant graphs ⋮ Perfect codes in circulant graphs ⋮ Unnamed Item ⋮ The (non-)existence of perfect codes in Fibonacci cubes ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ Unnamed Item ⋮ Constructing the minimum dominating sets of generalized de Bruijn digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On perfect codes in Cartesian products of graphs
• Elementary abelian covers of graphs
• Efficient domination in circulant graphs with two chord lengths
• An almost complete description of perfect codes in direct products of cycles
• Minimum fractional dominating functions and maximum fractional packing functions
• A contribution to the theory of voltage graphs
• Efficient dominating sets in Cayley graphs.
• Lifting graph automorphisms by voltage assignments
• Cubic vertex-transitive graphs on up to 1280 vertices
• The bondage numbers and efficient dominations of vertex-transitive graphs
• Perfect codes in graphs
• Independent perfect domination sets in Cayley graphs
• Vertex-transitive graphs: Symmetric graphs of prime valency
• An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
• Perfect domination in regular grid graphs

This page was built for publication: Efficient domination in cubic vertex-transitive graphs