Double covers and logics of graphs (Q3322154)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3853148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Double covers and logics of graphs |
scientific article; zbMATH DE number 3853148 |
Statements
1983
0 references
logics
0 references
double covers
0 references
neighborhood
0 references
Double covers and logics of graphs (English)
0 references
0.7243199348449707
0 references
0.7196699380874634
0 references
If \(A\subseteq VG\) then \(A^{\perp}\) is the set of all vertices of G which are adjacent to all vertices of A. In this paper, property P says for each \(x\in VG\), and for each subset Y of VG, the equality \(x^{\perp}=Y^{\perp}\) implies \(x\in Y\). The logic, \({\mathcal L}(G)\) of a graph G is a lattice derived from the operation \(A\mapsto A^{\perp}.\) This paper proves results such as ''To each graph G there exist infinitely many graphs G' without the property P, such that \({\mathcal L}(G)\cong {\mathcal L}(G')''.\)
0 references