2000 character limit reached
On powers of circular arc graphs
Published 17 Oct 2022 in cs.DM and math.CO | (2210.08782v2)
Abstract: A class of graphs $\mathcal{C}$ is closed under powers if for every graph $G\in\mathcal{C}$ and every $k\in\mathbb{N}$, $Gk\in\mathcal{C}$. Also $\mathcal{C}$ is strongly closed under powers if for every $k\in\mathbb{N}$, if $Gk\in\mathcal{C}$, then $G{k+1}\in\mathcal{C}$. It is known that circular arc graphs and proper circular arc graphs are closed under powers. But it is open whether these classes of graphs are also strongly closed under powers. In this paper we have settled these problems.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.