Font Size: a A A

Some Properties Of A Class Of Claw-free Graphs

Posted on:2008-10-08Degree:MasterType:Thesis
Country:ChinaCandidate:L WangFull Text:PDF
GTID:2120360215969630Subject:Basic mathematics
Abstract/Summary:PDF Full Text Request
In this thesis ,we mainly study the properties of a class of claw-free graphs, and we have the following results:(1) IfG is a connected claw-free graph , M ( G )={ x | x∈V ( G), x is locally connected } is a dominating set of G , M ( G )has two components M 1 ,M 2, then cl ( G )is completed if and only if there is a cycleC inG ,andC joins these two components such that there is a locally disconnected vertex x satisfies dG1 (x)≥2, dG2(x)≥2, Gi = i)∪N (Mi)>,dGi (x) = |NG (x)∩V(Gi)|.(2) IfG is a connected claw-free graph , M ( G )={ x | x∈V ( G), x is locally connected } is a dominating set of G , M ( G )has three components M1 , M2 ,M3, then cl ( G ) is completed if and only ifG satisfies one of the following conditions:(i) there is a cycleC inG ,andC joins these three components such that there are three locally disconnected vertices ; (ii) there are at least two componentsMi1 ,Mi2 such that V(Gi) 1∪V Gi2satisfies the conditions of (i) and there is a cycle C in G ,and C joins these three components such that there is a locally disconnected vertex x satisfies ,d<VGi1∪VGi2x>≥2dGi3x≥2, Gi = V(Mi)∪N (Mi) , d Gi(x) = NG (x)∩VGi,at last,we extend this result to M ( G ) has r components.(3) IfG is a connected claw-free graph , M ( G )={ x | x∈V ( G). x is locally connected }is a dominating set of G , M ( G )has two components ,if cl (G )is completed ,thenG is pancyclic.(4) IfG is a connected claw-free graph , M ( G )={ x | x∈V ( G), x is locally connected }is a dominating set ofG , M ( G ) has three components ,if cl ( G )is completed ,thenG is pancyclic except one case.(5) we get a new lower bound of cm ( n ), cm ( n )is the cycle lengths that can be missing in a claw-free on n vertices with complete closure.(6) IfG is a claw-free graph, G≥1 0,G have at least a vertex x , ( )N Gx is not locally connected or N G(x) is completed , M ( G )={ x | x∈V ( G), x is locally connected }is a dominating set of G , and M ( G )is connected, thenG has 2-factor with two components, moreover, G≥1 0is the best possible .
Keywords/Search Tags:claw-free graph, closure, pancyclic, dominating set, 2-factor
PDF Full Text Request
Related items