| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949556 | Discrete Applied Mathematics | 2017 | 9 Pages |
Abstract
In this paper, we have shown that a graph is a circular arc graph if and only if the corresponding symmetric digraph with loops is a circular arc digraph. We characterize circular arc digraphs and circular arc graphs using circular ordering of their edges. We also characterize a circular arc graph as a union of an interval graph and a threshold graph. Finally, we characterize proper interval bigraphs and proper circular arc bigraphs using two linear orderings of their vertex set.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ashok Kumar Das, Ritapa Chakraborty,