Abstract
AbstractGiven a family F of ordered pairs of sets {(Su,Tu): u ϵ V}, the intersection digraph of F is the digraph with vertices V defined by uv ϵ E(D) if Su ≠ Tv Ø. Interval digraphs are intersection digraphs of families in which every set is an interval, and were characterized in a previous paper by conditions on the adjacency matrix. In this paper, another such condition leads to an adjacency matrix characterization of circular‐arc digraphs, the intersection digraphs of families in which every set is an arc of a circle.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
