Independent perfect domination sets in Cayley graphs
From MaRDI portal
Publication:2746203
DOI10.1002/jgt.1016zbMath0996.05096OpenAlexW4256434233MaRDI QIDQ2746203
Publication date: 3 November 2002
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.1016
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (48)
Cyclotomic graphs and perfect codes ⋮ Efficient domination in circulant graphs with two chord lengths ⋮ Efficient domination in Cayley graphs of generalized dihedral groups ⋮ Total perfect codes in Cayley graphs ⋮ Subgroup sum graphs of finite abelian groups ⋮ Classification of efficient dominating sets of circulant graphs of degree 5 ⋮ Subgroup regular sets in Cayley graphs ⋮ Independent perfect dominating sets in semi-Cayley graphs ⋮ Subgroups as efficient dominating sets in Cayley graphs ⋮ Characterizing subgroup perfect codes by 2-subgroups ⋮ Iterative construction of the minimum independent dominating sets in hypercube graphs ⋮ Efficient dominating sets in circulant graphs with domination number prime ⋮ On the subgroup perfect codes in Cayley graphs ⋮ Subset Perfect Codes of Finite Commutative Rings Over Induced Subgraphs of Unit Graphs ⋮ On non-normal subgroup perfect codes ⋮ Perfect codes in vertex-transitive graphs ⋮ Injective coloring of graphs revisited ⋮ On subgroup perfect codes in Cayley sum graphs ⋮ Perfect Codes in Cayley Graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Regular sets in Cayley graphs ⋮ Efficient domination in cubic vertex-transitive graphs ⋮ Efficient \(k\)-distance dominating set in Cayley graphs ⋮ Efficient open domination in Cayley graphs ⋮ Subgroup Perfect Codes in Cayley Graphs ⋮ Perfect codes in proper reduced power graphs of finite groups ⋮ On subgroup perfect codes in Cayley graphs ⋮ The bondage numbers and efficient dominations of vertex-transitive graphs ⋮ (Total) domination in prisms ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ The cubic power graph of finite abelian groups ⋮ Efficient dominating sets in circulant graphs ⋮ Perfect codes in circulant graphs ⋮ Idomatic partitions of direct products of complete graphs ⋮ Connectivity and edge-bipancyclicity of Hamming shell ⋮ Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups ⋮ Existence of efficient total dominating sets of circulant graphs of degree 4 ⋮ Unnamed Item ⋮ Independent perfect domination sets in semi-Cayley graphs ⋮ Perfect domination sets in Cayley graphs ⋮ Characterization of subgroup perfect codes in Cayley graphs ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ Reinforcement numbers of digraphs ⋮ Perfect codes in Cayley sum graphs ⋮ Subgroup perfect codes in Cayley sum graphs ⋮ Domination in Cayley graphs: a survey ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs ⋮ Structure and substructure connectivity of circulant graphs and hypercubes
Cites Work
This page was built for publication: Independent perfect domination sets in Cayley graphs
