A (simple) proof of the rna conjecture on powers of cycles

TL;DR

This paper confirms a recent conjecture regarding the minimum bisection width, also known as the rna number, of powers of cycles, providing a simple proof for this graph theory problem.

Contribution

It offers a straightforward proof of the RNA conjecture on powers of cycles, advancing understanding in graph bisection problems.

Findings

Verification of the RNA conjecture for powers of cycles

Simplified proof methodology

Clarification of minimum bisection width in this context

Abstract

We verify a recent conjecture of Sehrawat, Kumar and Ahlawat on the minimum bisection width (a notion that was rediscovered in 2020 by Acharya and Kureethara under the name of rna number) of powers of cycles.