×

An interval digraph in relation to its associated bipartite graph. (English) Zbl 0792.05060

Authors’ abstract: The intersection digraph of a family of ordered pairs of sets \(\{(S_ v,T_ v):v \in V\}\) is the digraph \(D(V,E)\) such that \(uv \in E\) if and only if \(S_ u \cap T_ v \neq \varnothing\). Interval digraphs are those intersection digraphs for which the subsets are intervals on the real line. In a previous paper, they were characterized in terms of Ferrers digraphs and a close relationship was obtained between an interval digraph and a digraph of Ferrers dimension 2.
In order to characterize a digraph \(D\) of Ferrers dimension 2, Cogis associated an undirected graph \(H(D)\) with \(D\) in a suitable way, the vertices of \(H(D)\) corresponding to the zeros of the adjacency matrix of \(D\). He proved that \(D\) has Ferrers dimension at most 2 if and only if \(H(D)\) is bipartite. Depending on the above characterization, this paper first obtains some properties of a digraph of Ferrers dimension 2; then it is shown how the notion of interior edges is related to an interval digraph.
Reviewer: G.Chaty (Paris)

MSC:

05C20 Directed graphs (digraphs), tournaments
05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
06A07 Combinatorics of partially ordered sets
Full Text: DOI

References:

[1] Beineke, L. W.; Zamfirescu, C. M., Connection digraphs and second-order line graphs, Discrete Math., 39, 237-254 (1982) · Zbl 0483.05031
[2] Bouchet, A., Etude combinatoire des ordonnes finis applications, Theses d’Etat (1971), Grenoble
[3] Cogis, O., Ferrers digraphs and threshold graphs, Discrete Math., 38, 33-46 (1982) · Zbl 0472.06006
[4] Cogis, O., On the Ferrers dimension of a digraph, Discrete Math., 38, 47-52 (1982) · Zbl 0472.06007
[5] Cogis, O., A characterization of digraphs with Ferrers dimension 2, Rapport de Recherche, no 19 (1979), GR. CNRS no. 22 Paris
[6] Doignon, J. F.; Ducamp, A.; Falmagne, J. C., On realizable biorders and the biorder dimension of a realation, J. Math. Phych., 28, 73-109 (1984) · Zbl 0562.92018
[7] Ducamp, A.; Falmagne, J. C., Composite measurement, J. Math. Phych., 6, 359-390 (1969) · Zbl 0184.45501
[8] Golumbic, M. C., Algorithmic Graph Theory and Perfect Graphs (1980), Academic Press: Academic Press New York · Zbl 0541.05054
[9] Guttman, L., A basis for scaling quantitative data, Amer Soc. Rev., 9, 139-150 (1944)
[10] Riguet, J., Les relations de Ferrers, C.R. Acad, Sci. Paris, 232, 1729-1730 (1951) · Zbl 0042.24317
[11] Sen, M.; Das, S.; Roy, A. B.; West, D. B., Interval digraphs: An analogue of interval graphs, J. Graph Theory, 13, 189-202 (1989) · Zbl 0671.05039
[12] Sen, M.; Das, S.; West, D. B., Circular-arc digraphs: A characterization, J. Graph Theory, 13, 581-592 (1989) · Zbl 0689.05025
[13] West, D. B., Parameters of partial orders and graphs: packing, covering and representation, (Rival, I., Graphs and Order (1985), Reidel: Reidel Boston), 267-350 · Zbl 0568.05042
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.