Efficient dominating sets in Cayley graphs.

From MaRDI portal
Publication:1406027

DOI10.1016/S0166-218X(02)00573-5zbMath1035.05060MaRDI QIDQ1406027

Oriol Serra, Italo Jose Dejter

Publication date: 9 September 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)




Related Items (59)

Perfect codes and universal adjacency spectra of commuting graphs of finite groupsChromatic properties of the Pancake graphsCyclotomic graphs and perfect codesDomination ratio of a family of integer distance digraphs with arbitrary degreeThe fullerene graphs with a perfect star packingEfficient domination in circulant graphs with two chord lengthsEfficient domination in Cayley graphs of generalized dihedral groupsTotal perfect codes in Cayley graphsSubgroup sum graphs of finite abelian groupsClassification of efficient dominating sets of circulant graphs of degree 5Subgroup regular sets in Cayley graphsNonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3Subgroups as efficient dominating sets in Cayley graphsDomination ratio of integer distance digraphsCharacterizing subgroup perfect codes by 2-subgroupsEfficient dominating sets in circulant graphs with domination number primeOn the subgroup perfect codes in Cayley graphsSubset Perfect Codes of Finite Commutative Rings Over Induced Subgraphs of Unit GraphsAutomorphism groups of the Pancake graphsOn perfect codes in Cartesian products of graphsPerfect codes in vertex-transitive graphsOn subgroup perfect codes in Cayley sum graphsSemi Square Stable Graphs and Efficient Dominating SetsPerfect Codes in Cayley GraphsWorst-case efficient dominating sets in digraphsA generalization of Lee codesOn bondage numbers of graphs: a survey with some commentsRegular sets in Cayley graphsGraphs with constant sum of domination and inverse domination numbersEfficient domination in cubic vertex-transitive graphsEfficient \(k\)-distance dominating set in Cayley graphsLattice-like total perfect codesOn efficiently total dominatable digraphsEfficient open domination in Cayley graphsSubgroup Perfect Codes in Cayley GraphsTotal and paired domination numbers of toroidal meshesPerfect codes in proper reduced power graphs of finite groups\([1,2\)-sets in graphs] ⋮ On subgroup perfect codes in Cayley graphsThe bondage numbers and efficient dominations of vertex-transitive graphsConstructing dominating sets in circulant graphsEfficient absorbants in generalized de Bruijn digraphsOn Some Structural Properties of Star and Pancake GraphsThe cubic power graph of finite abelian groupsEfficient dominating sets in circulant graphsPerfect codes in circulant graphsDomination and efficient domination in cubic and quartic Cayley graphs on abelian groupsUnnamed ItemThe (non-)existence of perfect codes in Fibonacci cubesOn the distance domination number of bipartite graphsCharacterization of subgroup perfect codes in Cayley graphsOn efficient absorbant conjecture in generalized De Bruijn digraphsReinforcement numbers of digraphsPerfect codes in Cayley sum graphsSubgroup perfect codes in Cayley sum graphsDomination in Cayley graphs: a surveyThe total bondage numbers and efficient total dominations of vertex-transitive graphsPerfect domination ratios of Archimedean latticesConstructing the minimum dominating sets of generalized de Bruijn digraphs



Cites Work


This page was built for publication: Efficient dominating sets in Cayley graphs.