On the decycling of powers and products of cycles
Adrian Riskin

TL;DR
This paper determines the exact decycling numbers for specific graph products involving cycles, providing precise values for certain cases like the Cartesian product of cycles and powers of cycles.
Contribution
It offers exact decycling numbers for $C_{m} imes C_{n}$ with $m=3,4$, and for powers $C_{n}^{2}$ and $C_{n}^{3}$, advancing understanding of cycle graph decycling.
Findings
Exact decycling numbers for $C_{m} imes C_{n}$ when $m=3,4$
Exact decycling numbers for $C_{n}^{2}$ and $C_{n}^{3}$
Provides formulas and methods for calculating decycling numbers in these cases
Abstract
We calculate exact values of the decycling numbers of for , of , and of .
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
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Limits and Structures in Graph Theory
