Title of article :
A local independence number condition for n-extendable graphs
Author/Authors :
Dingjun Lou، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
Pages :
6
From page :
263
To page :
268
Abstract :
Let G be a graph and v ∈ V(G). Let Nk(v) = {u | u ∈ V(G) and d(u, v) = k}. It is proved that if G is a connected graph with ∞ > g(G) ⩾ 4 and with even order and if, for each vertex v in V(G), α(G[N2(v)]) ⩽ d(v) − 1, then G is regular and ⌈d(v)/4⌉-extendable. All results in this paper are sharp.
Keywords :
n-extendable graph , Local condition , Independence number
Journal title :
Discrete Mathematics
Serial Year :
1999
Journal title :
Discrete Mathematics
Record number :
951283
Link To Document :
بازگشت