Note on a closure concept and matching extension

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)171-175
Number of pages5
JournalAustralasian Journal of Combinatorics
Volume32
Publication statusPublished - 2005

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

Note on a closure concept and matching extension. / Nishimura, Tsuyoshi.

In: Australasian Journal of Combinatorics, Vol. 32, 2005, p. 171-175.

Research output: Contribution to journalArticle

@article{ae4c89b5199a4e239cb80d476b07e63a,
title = "Note on a closure concept and matching extension",
abstract = "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.",
author = "Tsuyoshi Nishimura",
year = "2005",
language = "English",
volume = "32",
pages = "171--175",
journal = "Australasian Journal of Combinatorics",
issn = "1034-4942",
publisher = "University of Queensland Press",

}

TY - JOUR

T1 - Note on a closure concept and matching extension

AU - Nishimura, Tsuyoshi

PY - 2005

Y1 - 2005

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

VL - 32

SP - 171

EP - 175

JO - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

SN - 1034-4942

ER -