Studies on Interval Digraphs.

Date of Submission

December 2010

Date of Award

Winter 12-12-2011

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Das, Sandip (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

The intersection digraph of a family of ordered pairs of sets {(Sv, Tv) : v ∈ V} is the digraph D(V, E) such that uv ∈ E if and only if Su ∩ Tv 6= ∅. Interval digraph are those intersection digraphs for which the subsets are intervals on the real line. We study the characterization of interval digraphs in terms of zeros partition property Sen (1) , (2) of its adjacency matrix and in terms of ferrers digraphs in Sen (1). The important problem of characterizing interval digraphs by its forbidden subgraphs is still open. Algorithm for recognizing interval digraphs was given in Muller (3). We ¨ propose an efficient algorithm for recognizing interval digraphs based our approach to characterize the class of all interval digraph using forbidden subgraphs


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.