dc.contributor.author 欧见平 dc.contributor.author 张福基 dc.date.accessioned 2017-11-14T02:51:33Z dc.date.available 2017-11-14T02:51:33Z dc.date.issued 2005-02-25 dc.identifier.citation 数学研究与评论,2005,(01):62-67 dc.identifier.issn 1000-341X dc.identifier.other SXYJ200501008 dc.identifier.uri https://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.abstract Let 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.sponsorship NationalNaturalScienceFoundationofChina(10271105) FoundationofEducationMinistryofFujian(JA03147) MinistryofScienceandTechnologyofFujian(2003J036) dc.language.iso zh_CN dc.subject 点可迁图 dc.subject 3限制边连通度 dc.subject 限制断片 dc.subject vertex-transitive graph dc.subject 3-restricted edge connectivity dc.subject restricted fragment dc.title 围长为3的点可迁图的3限制边连通度(英文) dc.title.alternative 3-Restricted Edge Connectivity of Vertex Transitive Graphs of Girth Three dc.type Article
﻿