Perfect bicoloring of the quintic graphs of order at most 10
Resumen
In this paper, we investigate the problem of finding perfect bicolorings for graphs with degree five and at most 10 vertices. A perfect bicoloring is a partition of the vertex set into two subsets such that each subset induces a regular subgraph. We use some algebraic techniques to construct parameter matrices that encode the properties of perfect bicolorings. We then classify all the possible parameter matrices for graphs with degree five and at most 10 vertices, and determine which of them correspond to graphs that admit perfect bicolorings.
Descargas
Derechos de autor 2025 Boletim da Sociedade Paranaense de Matemática
Esta obra está bajo licencia internacional Creative Commons Reconocimiento 4.0.
When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).
The journal utilize the Creative Common Attribution (CC-BY 4.0).
