DMCOMay 24

On powers of circular arc graphs

arXiv:2210.0878227.41 citationsh-index: 1
Predicted impact top 76% in DM · last 90 daysOriginality Synthesis-oriented
AI Analysis

Settles an open question in graph theory for researchers studying graph classes and their power closures.

The paper resolves the open problem of whether circular arc graphs and proper circular arc graphs are strongly closed under powers, proving that they are not.

A class of graphs $\mathcal{C}$ is closed under powers if for every graph $G\in\mathcal{C}$ and every $k\in\mathbb{N}$, $G^k\in\mathcal{C}$. Also $\mathcal{C}$ is strongly closed under powers if for every $k\in\mathbb{N}$, if $G^k\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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes