双广义Petersen图的可靠性分析（英文）

马胜栋; 孟吉翔

doi:10.13568/j.cnki.651094.2018.02.005

您当前的位置：

首页 >

文章列表页 >

双广义Petersen图的可靠性分析（英文）

更新时间：2026-01-21

- 双广义Petersen图的可靠性分析（英文）
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Vol. 35, Issue 2, Pages: 150-157(2018)
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
- DOI：10.13568/j.cnki.651094.2018.02.005
  CLC： O157.5
- Published：2018
- 稿件说明：
移动端阅览
[1]马胜栋,孟吉翔.双广义Petersen图的可靠性分析（英文）[J],2018,35(02):150-157.
[1]马胜栋,孟吉翔.双广义Petersen图的可靠性分析（英文）[J],2018,35(02):150-157. DOI： 10.13568/j.cnki.651094.2018.02.005.

DOI：10.13568/j.cnki.651094.2018.02.005.

摘要

设G是连通图

图G的超连通度(超边连通度)是指从图G中删除最小数目的点(边)使得G不连通

且在G的每个分支中不存在孤立点.周进鑫和冯衍全(2012)首次提出了双广义Petersen图的概念

文章证明了双广义Petersen图DP[n

k]是超连通和超边连通的

以及当n?{2k

3}时

κ1(DP[n

k])=λ1(DP[n

k])=4.

Abstract

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}.

关键词

Keywords

references

Sengupta S,Korobkin C P.Graphs and Digraphs[M].New York:Springer,1994.

Harary F.Conditional connectivity[J].Networks,1983,13(3):347–357.

Coxeter H S M.Self-dual configurations and regular graphs[J].Bulletin of the American Mathematical Society,1950,56(1950):413-455.

Mark E.Watkins.A theorem on tait colorings with an application to the generalized Petersen graphs[J].Journal of Combinatorial Theory,1969,6(2):152-164.

Zhou J X,Feng Y Q.Cubic Vertex-Transitive Non-Cayley Graphs of Order 8p[J].Electronic Journal of Combinatorics,2012,19(1):453-472.

Zhou J X,Feng Y Q.Cubic bi-Cayley graphs over abelian groups[J].European Journal of Combinatorics,2014,36(2):679-693.

Boesch F,Tindell R.Circulants and their connectivities[J].Journal of Graph Theory,2010,8(4):487-499.

Yang W H,Meng J X.Extraconnectivity of hypercubes(II)[J].Australas Journal of Combinatorics,2010,47:189-195.

Ekinci G B,K?rlangic?A.Super connectivity of Kronecker product of complete bipartite graphs and complete graphs[J].Discrete Mathematics,2016,339(7):1950-1953.

Min L,Chao W,Chen G,et al.On super connectivity of Cartesian product graphs[J].Networks,2010,52(2):78-87.

Ferrero D,Hanusch S.Component connectivity of generalized Petersen graphs[J].International Journal of Computer Mathematics,2014,91(9):1940-1963.

Boruzanl?Ekinci G,Gauci J B.On the reliability of generalized Petersen graphs[J].Discrete Applied Mathematics,[2017-02-24],https://doi.org/10.1016/j.dam.2017.02.002.

Kutnar K,Petecki P.On automorphisms and structural properties of double generalized Petersen graphs[J].Discrete Mathematics,2016,339(12):2861-2870.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰