Zobrazeno 1 - 10
of 226
pro vyhledávání: '"Lih-Hsing Hsu"'
Autor:
MENG-CHIEN YANG1 mcyang2@pu.edu.tw, LIH-HSING HSU1 lihhsing@gmail.com, CHUN-NAN HUNG2 spring@mail.dyu.edu.tw, EDDIE CHENG3 echeng@oakland.edu
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2020, Vol. 40 Issue 3, p713-731. 19p. 16 Diagrams.
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:
Fundamenta Informaticae. 173:33-45
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09a3bf573558695b52d1cf3b75c60aa0
https://doi.org/10.3233/fi-2020-1914
https://doi.org/10.3233/fi-2020-1914
Publikováno v:
The Computer Journal. 64:27-37
A graph $G=(V,E)$ is two-disjoint-cycle-cover $[r_1,r_2]$-pancyclic if for any integer $l$ satisfying $r_1 \leq l \leq r_2$, there exist two vertex-disjoint cycles $C_1$ and $C_2$ in $G$ such that the lengths of $C_1$ and $C_2$ are $l$ and $|V(G)| -
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70cd09123109bf2fb4a65bfec62f6693
https://doi.org/10.1093/comjnl/bxz134
https://doi.org/10.1093/comjnl/bxz134
Autor:
Lih-Hsing Hsu, Jeng-Jung Wang
Publikováno v:
Discrete Mathematics. 341:672-690
In this paper, we employed lattice model to describe the three internally vertex-disjoint paths that span the vertex set of the generalized Petersen graph P ( n , 3 ) . We showed that the P ( n , 3 ) is 3-spanning connected for odd n . Based on the l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dbf17bfef00550b6ce174a4168a7769d
https://doi.org/10.1016/j.disc.2017.11.005
https://doi.org/10.1016/j.disc.2017.11.005
Publikováno v:
The Computer Journal. 61:54-62
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a519313ea6d045b750932ca96861e4cd
https://doi.org/10.1093/comjnl/bxx034
https://doi.org/10.1093/comjnl/bxx034
Publikováno v:
Applicable Analysis and Discrete Mathematics. 9:1-12
A graceful labeling of a graph with q edges is a labeling of its vertices using the integers in [0, q], such that no two vertices are assigned the same label and each edge is uniquely identified by the absolute difference between the labels of its en
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ddefce7ab37accd6921bd8a06c35a427
https://doi.org/10.2298/aadm141009017w
https://doi.org/10.2298/aadm141009017w
Publikováno v:
ACIT/CSII/BCD
The study of pancyclicity is an important topic in studying the structures of interconnection networks. Indeed, many advanced results have been obtained for undirected interconnection networks. However, much less is known for the directed counterpart
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d208014889c56baf716eeddfc9348b8
https://doi.org/10.1109/acit-csii-bcd.2017.65
https://doi.org/10.1109/acit-csii-bcd.2017.65
Publikováno v:
Information Sciences. 271:236-245
Many research on the WK-recursive network has been published during the past several years due to its favorite properties. In this paper, we consider the fault-tolerant hamiltonian connectivity of the WK-recursive network. We use K ( d , t ) to denot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e74872b07e177dc3aa082ad1220ddcc
https://doi.org/10.1016/j.ins.2014.02.087
https://doi.org/10.1016/j.ins.2014.02.087
Publikováno v:
Discrete Applied Mathematics. 167:163-171
Let n be a positive integer with n>=3. The cube-connected cycles graph CCC"n has nx2^n vertices, labeled (l,x), where 0@?l@?n-1 and x is an n-bit binary string. Two vertices (l,x) and (l^',y) are adjacent if and only if either x=y and |l-l^'|=1, or l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c04bd4a3e65950017bf71bec42e70fa8
https://doi.org/10.1016/j.dam.2013.11.021
https://doi.org/10.1016/j.dam.2013.11.021