arXiv (All)
open access
Sharp zero forcing numbers for the generalized Petersen graphs $P(n,3)$ and $P(n,4)$
We prove that $Z(P(n,3))=8$ for every $n\ge13$ and $Z(P(n,4))=10$ for every $n\ge18$, with both stabilization thresholds sharp, and give the exact values for all smaller admissible $n$. The first equality proves Krishnan's Conjecture 5; his Proposition 4 supplies its upper bound. The lower bounds us
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A sharp higher-order Cheeger inequality#1381373
- Improved Explicit and Algorithmic Lower Bounds for r(5,t)#1216051
- Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948#997620
- Kriesell's conjecture for infinite graphs#999059
- On infinite families of $[P_n]$-irregular graphs#1051111
Record · ID 1388625
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive