The 4-set tree connectivity of hierarchical folded hypercube
Journal of Applied Mathematics and Computing · 2024-06 · 70 (3) · 2097-2114
DOI: 10.1007/s12190-024-02013-7 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Applied Mathematics and Computing, online erschienen am 22.03.2024. Verfasst von Junzhen Wang und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 33 Literaturangaben. Gefördert von: National Science Foundation of China.
Abstract (Originalsprache)
The k-set tree connectivity, as a natural extension of classical connectivity, is an extremely significant index to measure the fault-tolerance of interconnection networks. For a connected graph G=(V,E)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G=(V, E)$$\end{document} and a subset S⊆V\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S\subseteq V$$\end{document}, an S-tree T=(V′,E′)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T=(V',E')$$\end{document} of graph G is a tree that contains the subset S. Any two S-trees T and T′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T'$$\end{document} are internally disjoint if and only if E(T)∩E(T′)=∅\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E(T)\cap E(T')=\emptyset $$\end{document} and V(T)∩V(T′)=S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$V(T)\cap V(T')=S$$\end{document}. The cardinality of maximum internally disjoint S-trees is defined as κG(S)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa _{G}(S)$$\end{document}, and the k-set tree connectivity is denoted by κk(G)=min{κG(S)|S⊆V(G)and|S|=k}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa _{k}(G)=\min \{\kappa _{G}(S)|S\subseteq V(G)\ \text {and} \ |S|=k\}$$\end{document}. In this note, we determine the 4-set tree connectivity of HFQn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$HFQ_{n}$$\end{document}. That is, κ4(HFQn)=n+1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa _{4}(HFQ_{n})=n+1$$\end{document} for n≥7\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n\ge 7$$\end{document}, where HFQn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$HFQ_{n}$$\end{document} is hierarchical folded hypercube.
Förderung
- National Science Foundation of China
Zitieren
APA
Wang, J., Zou, J., & Zhang, S. (2024). The 4-set tree connectivity of hierarchical folded hypercube. Journal of Applied Mathematics and Computing, 70(3), 2097-2114. https://doi.org/10.1007/s12190-024-02013-7
Vancouver
Wang J, Zou J, Zhang S. The 4-set tree connectivity of hierarchical folded hypercube. Journal of Applied Mathematics and Computing. 2024;70(3):2097-2114. doi:10.1007/s12190-024-02013-7
BibTeX
@article{Wang2024,
author = {Wang, Junzhen and Zou, Jinyu and Zhang, Shumin},
title = {The 4-set tree connectivity of hierarchical folded hypercube},
journal = {Journal of Applied Mathematics and Computing},
year = {2024},
volume = {70},
number = {3},
pages = {2097--2114},
doi = {10.1007/s12190-024-02013-7}
}
EUVIMED