On powers of circular arc graphs

10/17/2022
โˆ™
by   Ashok Kumar Das, et al.
โˆ™
0
โˆ™

A class of graphs ๐’ž is closed under powers if for every graph Gโˆˆ๐’ž and every kโˆˆโ„•, G^kโˆˆ๐’ž. Also ๐’ž is strongly closed under powers if for every kโˆˆโ„•, if G^kโˆˆ๐’ž, then G^k+1โˆˆ๐’ž. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
โˆ™ 02/02/2022

Modification Problems toward Proper (Helly) Circular-arc Graphs

We present a 9^kยท n^O(1)-time algorithm for the proper circular-arc vert...
research
โˆ™ 01/17/2019

On Index coding for Complementary Graphs with focus on Circular Perfect Graphs

Circular perfect graphs are those undirected graphs such that the circul...
research
โˆ™ 02/22/2023

Easy testability for posets

Alon and Shapira proved that every class of undirected graphs closed und...
research
โˆ™ 07/10/2023

Winding number and circular 4-coloring of signed graphs

Concerning the recent notion of circular chromatic number of signed grap...
research
โˆ™ 06/04/2018

Strong Pseudo Transitivity and Intersection Graphs

A directed graph G=(V,E) is strongly pseudo transitive if there is a pa...
research
โˆ™ 09/12/2019

L(p,q)-Labeling of Graphs with Interval Representations

We provide upper bounds on the L(p,q)-labeling number of graphs which ha...
research
โˆ™ 08/16/2022

Representation Learning on Graphs to Identifying Circular Trading in Goods and Services Tax

Circular trading is a form of tax evasion in Goods and Services Tax wher...

Please sign up or login with your details

Forgot password? Click here to reset