Interval digraphs: An analogue of interv
✍
S. Das; M. Sen; A. B. Roy; D. B. West
📂
Article
📅
1989
🏛
John Wiley and Sons
🌐
English
⚖ 728 KB
Intersection digraphs analogous to undirected intersection graphs are introduced. Each vertex is assigned an ordered pair of sets, with a directed edge uu in the intersection digraph when the "source set" of u intersects the "terminal set" of u. Every n-vertex digraph is an intersection digraph of o