首页 | 本学科首页   官方微博 | 高级检索  
     


disjoint cycles containing specified independent vertices
Authors:Jiuying Dong  
Affiliation:aSchool of Information Technology, Jiangxi University of Finance, Nanchang 330013, PR China
Abstract:Let kgreater-or-equal, slanted1 be an integer and G be a graph of order ngreater-or-equal, slanted3k satisfying the condition that σ2(G)greater-or-equal, slantedn+k-1. Let v1,…,vk be k independent vertices of G, and suppose that G has k vertex-disjoint triangles C1,…,Ck with viset membership, variantV(Ci) for all 1less-than-or-equals, slantiless-than-or-equals, slantk.Then G has k vertex-disjoint cycles View the MathML source such that
(i) View the MathML source for all 1less-than-or-equals, slantiless-than-or-equals, slantk.
(ii) View the MathML source, and
(iii) At least k-1 of the k cycles View the MathML source are triangles.
The condition of degree sum σ2(G)greater-or-equal, slantedn+k-1 is sharp.
Keywords: Degree sum condition; Independent vertices; Vertex-disjoint cycles
Keywords:Degree sum condition   Independent vertices   Vertex-disjoint cycles
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号