Show simple item record

dc.contributor.author欧见平
dc.contributor.author张福基
dc.date.accessioned2017-11-14T02:51:33Z
dc.date.available2017-11-14T02:51:33Z
dc.date.issued2005-02-25
dc.identifier.citation数学研究与评论,2005,(01):62-67
dc.identifier.issn1000-341X
dc.identifier.otherSXYJ200501008
dc.identifier.urihttps://dspace.xmu.edu.cn/handle/2288/154977
dc.description.abstract设G是阶至少为6的k正则连通图.如果G的围长等于3,那么它的3限制边连通度 λ3(G)≤3k-6.当G是3或者4正则连通点可迁图时等号成立,除非G是4正则图并且 λ3(G)=4.进一步,λ3(G)=4的充分必要条件是图G含有子图K4.
dc.description.abstractLet G be a k-regular connected graph of order at least six. If G has girth three, its 3-restricted edge connectivity λ3(G) ≤3k-6. The equality holds when G is a cubic or 4-regular connected vertex-transitive graph with the only exception that G is a 4-regular graph with λ3(G) = 4. Furthermore, λ3(G) = 4 if and only if G contains K4 as its subgraph.
dc.description.sponsorshipNationalNaturalScienceFoundationofChina(10271105) FoundationofEducationMinistryofFujian(JA03147) MinistryofScienceandTechnologyofFujian(2003J036)
dc.language.isozh_CN
dc.subject点可迁图
dc.subject3限制边连通度
dc.subject限制断片
dc.subjectvertex-transitive graph
dc.subject3-restricted edge connectivity
dc.subjectrestricted fragment
dc.title围长为3的点可迁图的3限制边连通度(英文)
dc.title.alternative3-Restricted Edge Connectivity of Vertex Transitive Graphs of Girth Three
dc.typeArticle


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record