On a construction of critical graphs which are not sensitive (Q1064327)
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 3918413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a construction of critical graphs which are not sensitive |
scientific article; zbMATH DE number 3918413 |
Statements
On a construction of critical graphs which are not sensitive (English)
0 references
1985
0 references
Let G be a graph and L(G) be the closed-set lattice of G. In the paper it is shown that if a graph G has property \(L(G)\simeq L(G')\Rightarrow G\simeq G'\) then it holds L(G)\(\not\simeq L(G-e)\), for every edge e of G, and \(L(G)\not\simeq L(G+e)\), for every edge e of G, but there are examples that the reverse implication is not true.
0 references
closed-set lattice of a graph
0 references
sensitive graph
0 references
critical graph
0 references
0.9204212427139282
0 references
0.8539946675300598
0 references
0.8487090468406677
0 references
