MATRIX CHARACTERIZATIONS OF CIRCULAR-ARC GRAPHS.
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1970
- Accession Number
- AD0707797
Entities
People
- Alan Tucker
Organizations
- University of Wisconsin–Madison