๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Sequence of Closed-Set Lattices of a Graph

โœ Scribed by K. M. KOH; K. S. POH

Book ID
119862778
Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
283 KB
Volume
576
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the uniformity of the closed-set latt
On the uniformity of the closed-set lattice of a tree
โœ K.M. Koh; K.S. Poh ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 578 KB

Denote by e\*(L) and ~,(L) respectively the upper length and lower length of a finite lattice L. The lattice L is said to be uniform if for each integer k with e,(L) < k < ยข\*(L) there exists in L a maximal chain of length k. It is shown that the closed-set lattice of a finite graph G is uniform if

On the lower length of the closed-set la
On the lower length of the closed-set lattice of a tree
โœ K.M. Koh; K.S. Poh ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 395 KB

Let L(T) be the closed-set latice of a tree T. The lower length l, (L(T)) of L (T) is defined as Call a set S of vertices in T a sparse set if d(x, y)/> 3 for any two distinct vertices x, y in S. The sparsity y(T) of T is defined as y(T) = max {Isl: s is a sparse set of T}. We prove that, for any

On the covering graph of balanced lattic
On the covering graph of balanced lattices
โœ Manfred Stern ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 283 KB

Jakubik has shown that for discrete modular lattices all graph isomorphisms are given by certain direct product decompositions. Duffus and Rival have proved a similar theorem for graded lattices which are atomistic and coatomistic. Modifying some of the results of Duffus and Rival we give a common g