Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Chun-Nan Hung"'
Autor:
Chun-Nan Hung, 洪春男
87
Designing an optimal k-fault-tolerant network for token rings is equivalent to constructing an optimal k-hamiltonian graph, where k is a positive integer and corresponds to the number of faults. A graph G = (V, E) is k-hamiltonian if G - (V''
Designing an optimal k-fault-tolerant network for token rings is equivalent to constructing an optimal k-hamiltonian graph, where k is a positive integer and corresponds to the number of faults. A graph G = (V, E) is k-hamiltonian if G - (V''
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/17481949313611466953
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 713-731 (2020)
A graph G is called r-spanning cyclable if for every r distinct vertices v1, v2, . . . , vr of G, there exists r cycles C1, C2, . . . , Cr in G such that vi is on Ci for every i, and every vertex of G is on exactly one cycle Ci. In this paper, we con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::23d86d83586d0096795202703a9d6b75
https://doaj.org/article/67c1d7a8b45a47e688073e73478df3ce
https://doaj.org/article/67c1d7a8b45a47e688073e73478df3ce
Publikováno v:
International Journal of Computer Mathematics: Computer Systems Theory. 5:125-133
Pancylicity was introduced by Bondy in 1971. A graph G with vertex set V ( G ) and edge set E ( G ) is pancyclic if it contains cycles of lengths l, for 3 ≤ l ≤ | V ( G ) | . This concept has been ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f22096642094c249fec0e8570d0db53
https://doi.org/10.1080/23799927.2020.1803972
https://doi.org/10.1080/23799927.2020.1803972
Autor:
Chun-Nan Hung, Mohamad Abdallah
Publikováno v:
Journal of Interconnection Networks. 21
Given a graph [Formula: see text], its neighbor connectivity is the least number of vertices whose deletion along with their neighbors results in a disconnected, complete, or empty graph. The edge neighbor connectivity is the least number of edges wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cbad1f661926f4169e1c3331abab1907
https://doi.org/10.1142/s0219265921500146
https://doi.org/10.1142/s0219265921500146
Publikováno v:
Innovative Mobile and Internet Services in Ubiquitous Computing ISBN: 9783030797270
IMIS
IMIS
Interconnection networks are emerging as an approach to solving system-level communication problems. A network may be modeled by a graph whose vertices represent the nodes, and whose edges represent communication links. For any vertex v in a graph G,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c5ce93e03a0cd98a530ae03382dae58
https://doi.org/10.1007/978-3-030-79728-7_31
https://doi.org/10.1007/978-3-030-79728-7_31
Autor:
Tzu-Liang Kung, Chun-Nan Hung
Publikováno v:
Theoretical Computer Science. 670:45-55
The exact reliability of a complicated network system is usually difficult to determine, and numerical approximations may play a crucial role in indicating the reliable probability that a system is still operational under a specified suite of conditi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe8e50d2ac0a2de8e54911770afd12be
https://doi.org/10.1016/j.tcs.2017.01.021
https://doi.org/10.1016/j.tcs.2017.01.021
Autor:
Tzu-Liang Kung, Chun-Nan Hung
Publikováno v:
SNPD
It is usually difficult to determine the exact reliability of a complicated network system, and numerical estimation may play a critical role in indicating the likelihood that a systemcan be operational in a specified period of time. In this paper, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a3a82083131700d5dc4209f01c19995
https://doi.org/10.1109/snpd.2019.8935830
https://doi.org/10.1109/snpd.2019.8935830
Publikováno v:
SNPD
The study of cycle embedding is an important topic in studying the structures of interconnection networks. In this paper, we study the cycles embedding in pancake graphs. We show that every edge in the n-dimensional pancake graph lies on the cycle wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::826a42acece6c29aade9063abee06ff9
https://doi.org/10.1109/snpd.2019.8935880
https://doi.org/10.1109/snpd.2019.8935880
Publikováno v:
Innovative Mobile and Internet Services in Ubiquitous Computing ISBN: 9783319935539
IMIS
IMIS
The k-edges fault-tolerance-Hamiltonian graphs have been studied by many researchers. In this paper, we introduce the 2-path-required Hamiltonian graphs. We will show that the complete bipartite graph \(K_{n,n}\) is \((n-3)\)-edges fault-tolerance 2-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c75eeada81e0f255af82ad06adb3847
https://doi.org/10.1007/978-3-319-93554-6_61
https://doi.org/10.1007/978-3-319-93554-6_61
Publikováno v:
Innovative Mobile and Internet Services in Ubiquitous Computing ISBN: 9783319935539
IMIS
IMIS
Interconnection networks are emerging as an approach to solving system-level communication problems. An interconnection network is a programmable system that serves to transport data or messages between components/terminals in a network system. The h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8921be9ac00359a53b91007434896ed
https://doi.org/10.1007/978-3-319-93554-6_59
https://doi.org/10.1007/978-3-319-93554-6_59