On an isomorphism problem on the closed-set lattice of a graph (Q761474): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00383605 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2051370137 / rank | |||
Normal rank |
Latest revision as of 10:10, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On an isomorphism problem on the closed-set lattice of a graph |
scientific article |
Statements
On an isomorphism problem on the closed-set lattice of a graph (English)
0 references
1985
0 references
In an undirected graph G with the vertex set V(G) the symbol N(a) denotes the set of vertices which are adjacent to a vertex a. A subset S of V(G) is called closed, if \(N(a)\cap N(b)\subseteq S\) for any two distinct vertices a, b of S. Among closed sets of G there are also the empty set and all one-element subsets of V(G). All closed sets of G form the lattice \({\mathcal L}(G)\). If a graph G has the property that \({\mathcal L}(G)\cong {\mathcal L}(G')\) implies \(G\cong G'\) for every graph G', it is called sensitive. A lattice isomorphism \(\phi\) of \({\mathcal L}(G)\) onto \({\mathcal L}(G')\) induces the bijection \(\phi\) of V(G) onto V(G') such that \(\phi (x)=x'\) if and only if \(\Phi (\{x\})=\{x'\}.\) If for every graph G' such that \({\mathcal L}(G)\cong {\mathcal L}(G')\) and for each lattice isomorphism \(\Phi\) of \({\mathcal L}(G)\) onto \({\mathcal L}(G')\) the mapping \(\phi\) induced by \(\Phi\) is a graph isomorphism of G onto G', then G is said to be strongly sensitive. The covering graph of a lattice L is the graph whose vertex set is L and in which two vertices are adjacent if and only if one of them covers the other in L. Strongly sensitive graphs are characterized. It is proved that all graphs without circuits of the length 4 and all covering graphs of lattices are strongly sensitive.
0 references
closed-set lattice of a graph
0 references
covering graph of a poset
0 references
covering graph of a lattice
0 references
Strongly sensitive graphs
0 references