Affiliation:
1. Key Laboratory of Intelligent Computing Information Processing of Education School of Mathematics and Computational Science, Xiangtan University , Xiangtan, Hunan 411105, PR China
Abstract
AbstractEdge connectivity is an important parameter for the reliability of the inter-connection network. A graph $G$ is strong Menger edge-connected ($SM$-$\lambda $ for short) if there exist min$\{\deg _{G}(u),\deg _{G}(v)\}$ edge-disjoint paths between any pair of vertices $u$ and $v$ of $G$. The conditional edge-fault-tolerance strong Menger edge connectivity of $G$, denoted by $sm_{\lambda }^{r}(G)$, is the maximum integer $m$ such that $G-F$ remains $SM$-$\lambda $ for any edge set $F$ with $|F|\leq m$ and $\delta (G-F)\geq r$, where $\delta (G-F)\geq r$ is the minimum degree of $G-F$. Most of the previous papers discussed $sm_{\lambda }^{r}(G)$ in the case of $r\leq 2$. In this paper, we show that $sm_{\lambda }^{r}(FQ_{n})=2^{r}(n-r+1)-(n+1)$ for $1\leq r\leq n-2$, where $n\geq 4$.
Funder
Youth Project of Hunan Provincial Natural Science Foundation of China
Project of Education Department of Hunan Province
Project of Scientific Research Fund of Hunan Provincial Science and Technology Department
Publisher
Oxford University Press (OUP)
Reference24 articles.
1. Graph Theory with Applications
2. The edge-connectivity, average-connectivity and degree conditions;Fricke;Unpublished manuscript,2000
3. Maximally local-edge-connected graphs and digraphs;Hellwig;Ars Combin.,2004
4. Edge fault-tolerance of strongly Menger edge connected graphs;Li;Discrete Math.,2022
5. A survey on fault tolerance in small and large scale wireless sensor networks;Chouikhi;Comput. Commun.,2015
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献