Adjacency matrices of probe interval graphs

In this paper we obtain several characterizations of the adjacency matrix of a probe interval graph. In course of this study we describe an easy method of obtaining interval representation of an interval bigraph from its adjacency matrix. Finally, we note that if we add a loop at every probe vertex of a probe interval graph, then the Ferrers dimension of the corresponding symmetric bipartite graph is at most 3.

[1]  Van Bang Le,et al.  Probe Split Graphs , 2007, Discret. Math. Theor. Comput. Sci..

[2]  Martin Charles Golumbic,et al.  Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs , 2007, SIAM J. Discret. Math..

[3]  P. Hell,et al.  Interval bigraphs and circular arc graphs , 2004 .

[4]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[5]  J. Richard Lundgren,et al.  Bipartite probe interval graphs, circular arc graphs, and interval point bigraphs , 2006, Australas. J Comb..

[6]  Van Bang Le,et al.  On probe classes of graphs , 2006, Electron. Notes Discret. Math..

[7]  Michael Hager.  On Halin-lattices in graphs , 1983, Discret. Math..

[8]  Douglas B. West,et al.  Circular-arc digraphs: A characterization , 1989, J. Graph Theory.

[9]  Sergey N. Rodin,et al.  Graphs and Genes , 1984 .

[10]  Douglas B. West,et al.  Representing digraphs using intervals or circular arcs , 1995, Discret. Math..

[11]  Douglas B. West,et al.  Short proofs for interval digraphs , 1998, Discret. Math..

[12]  P. Gilmore,et al.  A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[13]  F. McMorris,et al.  Topics in Intersection Graph Theory , 1987 .

[14]  Gerard J. Chang,et al.  Probe interval bigraphs , 2005, Electron. Notes Discret. Math..

[15]  Martin Charles Golumbic,et al.  Chordal probe graphs , 2004, Discret. Appl. Math..

[16]  Douglas B. West,et al.  Interval digraphs: An analogue of interval graphs , 1989, J. Graph Theory.

[17]  Haiko Müller,et al.  Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time , 1997, Discret. Appl. Math..

[18]  Dieter Kratsch,et al.  On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs , 2005, COCOON.

[19]  J. R. Lundgren,et al.  Variations on Interval Graphs , 2001 .

[20]  Jeremy P. Spinrad,et al.  Construction of probe interval models , 2002, SODA '02.

[21]  Fred R. McMorris,et al.  On Probe Interval Graphs , 1998, Discret. Appl. Math..

[22]  Jeremy P. Spinrad,et al.  A polynomial time recognition algorithm for probe interval graphs , 2001, SODA '01.

[23]  S. Benzer.  ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE. , 1959, Proceedings of the National Academy of Sciences of the United States of America.

[24]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .