It is shown that a (finite or infinite) digraph D is the catch digraph of a family of pointed intervals if and only if it contains no set of three vertices which Wail: any two of them are weakly connected by a chain where no initial endpoint of an arc precedes the third vertex. Furthermore, it is s
New characterizations of digraphs represented by intervals
β Scribed by Sanyal, Barun K.; Sen, Malay K.
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 413 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
We present new characterizations of interval digraphs, interval graphs, and indifference digraphs, using linear orderings of edges and vertices.
π SIMILAR VOLUMES
## Abstract As a digraph analog of the intersection graph, a family of pointed sets represents a digraph. This paper studies those digraphs represented by families of pointed convex sets, pointed boxes, and pointed spheres, in Euclidean spaces.
One of the first characterizations of interval graphs, given by Lekkerkerker and Boland (1962), uses the concept of an asteroidal triple. In this paper we give a similar characterization on the proper interval graphs using the akin concept of an astral triple.
Two new polyamidoximes having appropriate functions to bmd transition metal ions such as Ni(I1) and I'd(H) were prepared. Polymers were obtained by the reactions of (E,E)-dichloroglyoxime with new aromatic primary amines. Polymers and their complexes were characterized by elemental analyses, i.r. an
## Abstract In this paper, a new shape optimization approach is proposed to provide an efficient optimization solution of complex structures represented by polygonal meshes. Our approach consists of three main steps: (1) surface partitioning of polygonal meshes; (2) generation of shape design varia