On a construction of critical graphs which are not sensitive (Q1064327): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:10, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a construction of critical graphs which are not sensitive |
scientific article |
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
