Edge fault-tolerance of super restricted  edge-connected Cartesian product graphs

doi:10.3969/j.issn.0253-2778.2014.12.001

Journal of University of Science and Technology of China ›› 2014, Vol. 44 ›› Issue (12): 967-974.DOI: 10.3969/j.issn.0253-2778.2014.12.001

• Original Paper •

Edge fault-tolerance of super restricted edge-connected Cartesian product graphs

HONG Zhenmu, XU Junming

School of Mathematical Sciences, University of Science and Technology of China; Wu Wentsun Key Laboratory of Mathematics, USTC, Chinese Academy of Sciences, Hefei 230026, China

Received:2013-12-12 Revised:2014-03-19 Accepted:2014-03-19 Online:2014-03-19 Published:2014-03-19
Contact: XU Junming
About author:HONG Zhenmu, male, born in 1987, PhD candidate. Research field: combinatorics and graph theory.
Supported by:
Supported by NSFC (61272008).

Abstract

Abstract: A subset F of edges in a connected graph G is a restricted edge-cut if G-F is disconnected and every component has at least two vertices. A graph G is super restricted edge-connected (super-λ′ for short) if every minimum restricted edge-cut of G isolates at least one edge. The edge fault-tolerance ρ′(G) of a super-λ′ graph G is the maximum integer m for which G-F is still super-λ′ for any subset FE(G) with |F|≤m. It was shown that

Key words: graphs, connectivity, fault tolerance, super restricted edge-connected, Cartesian product, regular graphs, networks

CLC Number:

HONG Zhenmu, XU Junming. Edge fault-tolerance of super restricted edge-connected Cartesian product graphs[J]. Journal of University of Science and Technology of China, 2014, 44(12): 967-974.

[1]	Wang Ning, Xi Mao, Zhou Wengang, Li Li, Li Houqiang. Recent advance in deep visual object tracking [J]. Journal of University of Science and Technology of China, 2021, 51(4): 335-344.
[2]	Liu Sen, Zhang Zhizheng, Yu Tao, Chen Zhibo. MOVIE: Mesh oriented video inpainting network [J]. Journal of University of Science and Technology of China, 2021, 51(1): 1-11.
[3]	SUN Lei, ZHANG Yining, XUE Yanfang, QIAO Lishan, ZHANG Limei. Adaptive functional connectivity network learning and application in brain disorders identification [J]. Journal of University of Science and Technology of China, 2020, 50(8): 1102-1109.
[4]	XIN Shouyu, ZHENG Ruirui, ZHOU Yu, LIU Wenpeng, HE Jianjun. A one-shot learning algorithm using support set information during training [J]. Journal of University of Science and Technology of China, 2020, 50(8): 1187-1192.
[5]	WANG Yue, LI Jing. Research on optimization method of convolutional neural network based on visualization [J]. Journal of University of Science and Technology of China, 2020, 50(7): 959-967.
[6]	. Focused loss-based for imbalanced data scenarios integrated classification methods for CGAN [J]. Journal of University of Science and Technology of China, 2020, 50(7): 968-976.
[7]	. A note on the maximal degree in random k-trees [J]. Journal of University of Science and Technology of China, 2020, 50(3): 328-334.
[8]	. On 2-extra edge connectivity of folded crossed cube [J]. Journal of University of Science and Technology of China, 2020, 50(2): 94-99.
[9]	LIU Yan, RAO Yuan. A new method node importance evaluation based on multi-domain topology characteristics in complex networks [J]. Journal of University of Science and Technology of China, 2019, 49(7): 533-543.
[10]	ZHANG Fuquang, WU Yin, YANG Xubing. A mobility evaluation routing protocol for delay tolerant networks [J]. Journal of University of Science and Technology of China, 2019, 49(2): 132-137.
[11]	WU Yichen, ZHANG Shuguang. Defence mechanism against wormhole attacks based on grid [J]. Journal of University of Science and Technology of China, 2019, 49(1): 1-7.
[12]	SUN Zhi, SUN Xuejiao. Application of the pruning technique in dominant query [J]. Journal of University of Science and Technology of China, 2018, 48(9): 723-729.
[13]	SUN Gengxin, BIN Sheng. Network public opinion propagation model based on interest matching in multiple relationship social network [J]. Journal of University of Science and Technology of China, 2018, 48(9): 730-738.
[14]	. On total {k}-domatic number of Cartesian and direct product of graphs [J]. Journal of University of Science and Technology of China, 2018, 48(8): 605-611.
[15]	. Sufficient conditions for digraphs to be maximally connected and super-connected [J]. Journal of University of Science and Technology of China, 2018, 48(8): 612-617.

Edge fault-tolerance of super restricted edge-connected Cartesian product graphs

PDF (PC)

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

Comments