Matrix characterizations of circular-arc graphs
Alan C. Tucker · Pacific Journal of Mathematics · 1971
Abstract : A graph G is a circular-arc graph if there is a 1-1 correspondence between the vertices of G and a family of arcs on a circle such that two distinct vertices are adjacent when the corresponding arcs intersect. Circular-arc graphs are characterized in terms of their adjacency matrix. (Author)