Perfect 3-colorings of the generalized Petersen graphs GP(n,2)

We enumerate the parameter matrices of all perfect 3-colorings of the generalized Petersen graphs GP(n,2), n >= 5. We show that there are only five matrices that can be the parameter matrix of such a coloring. Two of them occur if and only if 5 | n, two occur if and only if 3 | n, and the remaining one occurs if and only if 10 | n.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.21435
Primary Topic
Advanced Graph Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Perfect 3-colorings of the generalized Petersen graphs GP(n,2)

Hamed Karami
arXiv (Cornell University)
Advanced Graph Theory Research
preprint

Perfect 3-colorings of the generalized Petersen graphs GP(n,2)

Hamed Karami
preprint en

Abstract

We enumerate the parameter matrices of all perfect 3-colorings of the generalized Petersen graphs GP(n,2), n >= 5. We show that there are only five matrices that can be the parameter matrix of such a coloring. Two of them occur if and only if 5 | n, two occur if and only if 3 | n, and the remaining one occurs if and only if 10 | n.

arXiv (Cornell University)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon