Perfect 2-colorings of the generalized Petersen graph GP(n,3)
Hamed Karami
TL;DR
This paper systematically classifies all perfect 2-colorings of the generalized Petersen graphs GP(n,3) for n>=7, providing a comprehensive understanding of their coloring structures.
Contribution
It enumerates all parameter matrices for perfect 2-colorings of GP(n,3), advancing the combinatorial understanding of these graphs.
Findings
Complete enumeration of parameter matrices for GP(n,3)
Basic results for GP(n,k) generalizations
Enhanced understanding of graph coloring patterns
Abstract
In this paper we enumerate the parameter matrices of all perfect 2-colorings of the generalized Petersen graphs GP(n;3), where n>=7. We also give some basic results for GP(n; k).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Graph Labeling and Dimension Problems · Advanced Graph Theory Research