Font Size: a A A

The Chvátal-Erd(?)s Condition For Vertex-pancyclism

Posted on:2020-02-29Degree:MasterType:Thesis
Country:ChinaCandidate:J J YangFull Text:PDF
GTID:2370330596967261Subject:Applied Mathematics
Abstract/Summary:PDF Full Text Request
This dissertation studies the vertex-pancyclism of a class of Chv(?)tal-Erd(?)s graphs.For a graph G with a(G)<k(G),K(G)? 3,where a(G)is the independence number of G and K(G)is the connectivity of G,if NG(v)has at most one edge for every vertex v V(G),then G satisfies ? G is k-regular and a(G)+1 = k(G),k = k(G);? The diameter diam(G)? 2;? Such graph G is vertex-pancyclic.
Keywords/Search Tags:Connectivity, Independence number, Vertex-pancyclism
PDF Full Text Request
Related items