标题:Degree sum conditions on two disjoint cycles in graphs
作者:Yan, Jin; Zhang, Shaohua; Ren, Yanyan; Cai, Junqing
作者机构:[Yan, Jin; Zhang, Shaohua] Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China.; [Ren, Yanyan] Shandong Univ, Sch Econ, Jinan 250100, S 更多
通讯作者:Yan, Jin
通讯作者地址:[Yan, J]Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China.
来源:INFORMATION PROCESSING LETTERS
出版年:2018
卷:138
页码:7-11
DOI:10.1016/j.ipl.2018.05.004
关键词:Graph algorithms; Degree sum; Cycle; Pancyclic; Disjoint
摘要:Let G be a simple undirected graph on n vertices. A set of subgraphs of G is disjoint if no two of them have any common vertex in G. Suppose that n(1), n(2) are two integers with n(1), n(2) >= 3 and n = n(1) + n(2). We prove that if d(x)+d(y) >= n + 4 for any pair of vertices x, y of G with xy is not an element of(G), then G contains two disjoint cycles of length n(1) and n(2). (C) 2018 Elsevier B.V. All rights reserved.
收录类别:EI;SCOPUS;SCIE
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85047613856&doi=10.1016%2fj.ipl.2018.05.004&partnerID=40&md5=70e13cf8b9f366ef6cff671b2a31b883
TOP