TY - JOUR
T1 - Note on a closure concept and matching extension
AU - Nishimura, Tsuyoshi
PY - 2005/12/1
Y1 - 2005/12/1
N2 - We prove the following theorems: (i) Let G be a graph and let x be a locally 2n-connected vertex. Let {u,v} be a pair of vertices in V(G) - {x} such that uv ∉ E(G), x ∈ NG(u) ∩ NG(v), and NG(x) ⊂ NG(u) ∪ NG(v) ∪ {u, v}. Then if G + uv is n-extendable, then G is n-extendable or G is a member of the exceptional family F of graphs described. (ii) Let G be a (2n + l)-connected graph. Let {u,v,x} be a three-vertex subset of V(G) such that uv ∉ E(G), x ∈ NG(u) ∩ NG(v), and NG(x) ⊂ NG(u) ∪ NG(v) ∪ {u,v}. If G + uv is n-extendable, then G is n-extendable or G is a member of the exceptional family F of graphs described.
AB - We prove the following theorems: (i) Let G be a graph and let x be a locally 2n-connected vertex. Let {u,v} be a pair of vertices in V(G) - {x} such that uv ∉ E(G), x ∈ NG(u) ∩ NG(v), and NG(x) ⊂ NG(u) ∪ NG(v) ∪ {u, v}. Then if G + uv is n-extendable, then G is n-extendable or G is a member of the exceptional family F of graphs described. (ii) Let G be a (2n + l)-connected graph. Let {u,v,x} be a three-vertex subset of V(G) such that uv ∉ E(G), x ∈ NG(u) ∩ NG(v), and NG(x) ⊂ NG(u) ∪ NG(v) ∪ {u,v}. If G + uv is n-extendable, then G is n-extendable or G is a member of the exceptional family F of graphs described.
UR - http://www.scopus.com/inward/record.url?scp=84885904840&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84885904840&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:84885904840
SN - 1034-4942
VL - 32
SP - 171
EP - 175
JO - Australasian Journal of Combinatorics
JF - Australasian Journal of Combinatorics
ER -