摘要
设G是连通图,图G的超连通度(超边连通度)是指从图G中删除最小数目的点(边)使得G不连通,且在G的每个分支中不存在孤立点.周进鑫和冯衍全(2012)首次提出了双广义Petersen图的概念,文章证明了双广义Petersen图DP[n,k]是超连通和超边连通的,以及当n?{2k,3}时,κ_1(DP[n,k])=λ_1(DP[n,k])=4.
The super-connectivity（super-edge-connectivity） of a connected graph G is the minimum number of vertices（edges） that need to be deleted from G in order to disconnect G without creating isolated vertices.The concept of double generalized Petersen graphs was introduced by Zhou and Feng（2012）.In this paper,we determine when the double generalized Petersen graph DP[n,k]are super-connected and super-edge-connected,and show that their super-connectivity and their super-edge-connectivity are both equal to four when n？{2k,3}.
作者
马胜栋
孟吉翔
MA Shengdong, MENG Jixiang(School of Mathematics and System Sciences, Xinjiang University, Urumqi Xinjiang 830046, Chin)
出处
《新疆大学学报（自然科学版）》
CAS
2018年第2期150-157,共8页
Journal of Xinjiang University(Natural Science Edition)
基金
supported by National Natural Science Foundation of China(11531011,11401510)
the Key Laboratory Project of Xinjiang(2015KL019)
