On a construction of critical graphs which are not sensitive (Q1064327): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4187840 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On an isomorphism problem on the closed-set lattice of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3342605 / rank | |||
Normal rank |
Latest revision as of 19:00, 14 June 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