Research Working Papers

WP32 · v1.0 · current

Zero-Forcing Bounds for Generalized Petersen Graphs: Computational Discovery and Certified Proofs for P(n,5)

Simon-Pierre Boucher

Version
v1.0 (#1)
Date
October 2026
Description
Current manuscript as published on www.spboucher.ai (revised edition after the 2026-10-17 scientific review for papers 1–17).
Pages
36
SHA-256
5b95803ac64fa0a9328a4857d150052b822c0f098238b276d193edda50490f86
Download PDF (v1.0)

← Back

WP32 v1 · Zero-Forcing Bounds for Generalized Petersen Graphs: Computational Discovery and Certified Proofs for P(n,5) · Research Working Papers