On a construction of critical graphs which are not sensitive
type: Item
instance of: scholarly article
title: On a construction of critical graphs which are not sensitive
zbMATH Open document ID: 0575.05048
DOI: 10.1007/BF02582951
author: K. S. Poh
author: K. M. Koh
published in: Graphs and Combinatorics
publication date: 1985-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3918413
zbMATH Keywords: closed-set lattice of a graph
zbMATH Keywords: sensitive graph
zbMATH Keywords: critical graph
reviewed by: Peter Horák
MaRDI profile type: Publication
cites work: Q4187840
cites work: On an isomorphism problem on the closed-set lattice of a graph
cites work: Q3342605
full work available at URL: https://doi.org/10.1007/bf02582951
OpenAlex ID: W2001833256
description: scientific article; zbMATH DE number 3918413