Abstract
Indifference digraphs, an analogue of indifference graphs, are introduced. They are shown to be equivalent to two restricted classes of interval digraphs, unit interval digraphs and proper interval digraphs, also introduced in this paper. These digraphs are characterized in terms of their adjacency matrices and in terms of a generalized concept of a semiorder. The results generalize the corresponding results for undirected graphs and provide a generalization of the Scott–Suppes theorem characterizing semiorders.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
