Classification of perfect and total perfect codes in generalized Petersen graphs
Abstract
In a graph , a perfect code is an independent set C with the property that every vertex not in C is adjacent to a unique vertex in C, and a total perfect code is a set C of vertices of such that every vertex of is adjacent to a unique vertex in C. We classify these codes for generalized Petersen graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.