Subgroups as efficient dominating sets in Cayley graphs
From MaRDI portal
Publication:385141
DOI10.1016/j.dam.2012.09.005zbMath1277.05130OpenAlexW2071023321MaRDI QIDQ385141
T. Tamizh Chelvam, Sivagnanam Mutharasu
Publication date: 29 November 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.09.005
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (20)
Domination ratio of a family of integer distance digraphs with arbitrary degree ⋮ Efficient domination in Cayley graphs of generalized dihedral groups ⋮ Subgroup sum graphs of finite abelian groups ⋮ Independent perfect dominating sets in semi-Cayley graphs ⋮ Domination ratio of integer distance digraphs ⋮ Characterizing subgroup perfect codes by 2-subgroups ⋮ Efficient dominating sets in circulant graphs with domination number prime ⋮ Perfect codes in vertex-transitive graphs ⋮ On subgroup perfect codes in Cayley sum graphs ⋮ Perfect Codes in Cayley Graphs ⋮ Subgroup Perfect Codes in Cayley Graphs ⋮ On subgroup perfect codes in Cayley graphs ⋮ Constructing dominating sets in circulant graphs ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ The cubic power graph of finite abelian groups ⋮ Efficient dominating sets in circulant graphs ⋮ Independent perfect domination sets in semi-Cayley graphs ⋮ Characterization of subgroup perfect codes in Cayley graphs ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ Domination in Cayley graphs: a survey
Cites Work
This page was built for publication: Subgroups as efficient dominating sets in Cayley graphs
