摘要
对于连通图X=(V,E),如果X-F不连通并且X-F的每个分支至少含k个点,那么边集F⊆E是一个k-限制性边割.图X的k-限制性边连通度λ_(k)(X)为X的最小k-限制性边割的基数.该文给出了混合Cayley图的3-限制性边连通度和λ_(3)-最优性.
For a connected graph X=(V,E),an edge set F⊆E is a k-restricted edge cut if X-F is disconnected such that every component of X-F has at least k vertices.The k-restricted edge connectivityλ_(k)(X)of the graph X is the cardinality of a minimum k-restricted edge cut of X.The article provides the 3-restricted edge connectivity and theλ3-optimal of the mixed Cayley graphs.
作者
陈来焕
孟吉翔
刘凤霞
CHEN Lai-huan;MENG Ji-xiang;LIU Feng-xia(College of Mathematics and Information Science,Henan University of Economics and Law,Zhengzhou 450003,China;College of Mathematics and System Sciences,Xinjiang University,Urumqi 830046,China)
出处
《高校应用数学学报（A辑）》
北大核心
2024年第1期114-120,共7页
Applied Mathematics A Journal of Chinese Universities(Ser.A)
基金
国家自然科学基金(11961067)
新疆自然科学基金(2020D04046)。
关键词
混合Cayley图
限制性边连通度
原子
最优性
mixed Cayley graph
restricted edge connectivity
atom
optimal MR Subject Classification:05C
