Some integer values in the spectra of burnt pancake graphs
Sa\'ul A. Blanco, Charles Buehrle

TL;DR
This paper investigates the spectral properties of burnt pancake graphs, revealing that their adjacency spectra include all integers from 0 to n except the floor of n/2, highlighting specific spectral characteristics.
Contribution
The paper proves that the adjacency spectrum of burnt pancake graphs contains all integers from 0 to n except one specific value, providing new insights into their spectral structure.
Findings
Spectral analysis of $ ext{BP}_n$ includes all integers 0 to n except $loor{n/2}$.
Identifies specific integer values in the spectrum of burnt pancake graphs.
Advances understanding of spectral properties of permutation-based graphs.
Abstract
The burnt pancake graph, denoted by , is formed by connecting signed permutations via prefix reversals. Here, we discuss some spectral properties of . More precisely, we prove that the adjacency spectrum of contains all integer values in the set .
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
TopicsGenome Rearrangement Algorithms · Advanced Combinatorial Mathematics · Cellular Automata and Applications
