A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Perfect codes in vertex-transitive graphs
[article]
2021
arXiv
pre-print
Given a graph Γ, a perfect code in Γ is an independent set C of vertices of Γ such that every vertex outside of C is adjacent to a unique vertex in C, and a total perfect code in Γ is a set C of vertices of Γ such that every vertex of Γ is adjacent to a unique vertex in C. To study (total) perfect codes in vertex-transitive graphs, we generalize the concept of subgroup (total) perfect code of a finite group introduced in as follows: Given a finite group G and a subgroup H of G, a subgroup A of
arXiv:2112.06236v1
fatcat:ygj7qld5ezeydb3jd63w4ogwje