✦ LIBER ✦

On the covering graph of balanced lattices

✍ Scribed by Manfred Stern

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 283 KB
Volume: 156
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00061-z

No coin nor oath required. For personal study only.

✦ Synopsis

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 generalization proved for lattices which are balanced and graded.

📜 SIMILAR VOLUMES

On the coverings of graphs

✍ F.R.K. Chung 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 383 KB

On covering all cliques of a chordal gra

On covering all cliques of a chordal graph

✍ Thomas Andreae; Carsten Flotow 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 205 KB

For a graph G = (V,E), a vertex set XC\_ V is called a clique if Ixl>~2 and the graph G [X] induced by X is a complete subgraph maximal under inclusion. We say that a vertex set T is a clique-transversal set if T N X ~ 0 for all cliques X of G, and define the clique-transversal number re(G) as the m

On the bipartite independence number of

On the bipartite independence number of a balanced bipartite graph

✍ Odile Favaron; Pedro Mago; Oscar Ordaz 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 603 KB

Venezuela Ap. 47567, Caracas Favaron, O., P. Mago and 0. Ordaz, On the bipartite independence number of a balanced bipartite graph, Discrete Mathematics 121 (1993) 55-63. The bipartite independence number GI aIp of a bipartite graph G is the maximum order of a balanced independent set of G. Let 6 b

The chromatic covering number of a graph

✍ Reza Naserasr; Claude Tardif 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

Following [1] , we investigate the problem of covering a graph G with induced subgraphs G 1 ; . . . ; G k of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciprocals of the chromatic numbers of the G i 's containing u is at least 1. The existence of such ''ch

On total covers of graphs

✍ Yousef Alavi; Jiuqiang Liu; Jianfang Wang; Zhongfu Zhang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 292 KB

Bounds for the covering number of a grap

Bounds for the covering number of a graph

✍ H.L. Abbott; A.C. Liu 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 333 KB