Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On powers of circular arc graphs (2210.08782v2)

Published 17 Oct 2022 in cs.DM and math.CO

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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.