Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3

DOI10.1016/j.dam.2017.07.013zbMath1372.05160arXiv1703.06540OpenAlexW2601729471MaRDI QIDQ2410229

Oscar Tomaiconza, Italo Jose Dejter

Publication date: 17 October 2017

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

Full work available at URL: https://arxiv.org/abs/1703.06540

zbMATH Keywords

Cayley graphefficient dominating setsphere packing

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Perfect codes from \(\operatorname{PGL}(2,5)\) in star graphs ⋮ The strong metric dimension of the power graph of a finite group

Uses Software

• OEIS

Cites Work

• Cayley graphs as classifiers for data mining: the influence of asymmetries
• Efficient dominating sets in Cayley graphs.
• On a diameter bound for Cayley graphs generated by transposition trees
• Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
• A group-theoretic model for symmetric interconnection networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3