Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Yuan-Lung Lin"'
Autor:
Yuan-Lung Lin, 林遠隆
100
A complete multigraph of order n and index λ, denoted by λKn, is a graph with n vertices, where any two distinct vertices u and v are joined by λ edges uv. A decomposition of a graph G is a collection H = {H_1, H_2, ..., H_t} of subgraphs
A complete multigraph of order n and index λ, denoted by λKn, is a graph with n vertices, where any two distinct vertices u and v are joined by λ edges uv. A decomposition of a graph G is a collection H = {H_1, H_2, ..., H_t} of subgraphs
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/13155062610857870181
Autor:
Yuan-Lung Lin, 林遠隆
93
A graph is called a bipartite graph if the vertex set of the graph can be partitioned into two disjoint nonempty sets, and any two vertices in the same set are not adjacency. Moreover, if any two vertices in the different set are adjacency, t
A graph is called a bipartite graph if the vertex set of the graph can be partitioned into two disjoint nonempty sets, and any two vertices in the same set are not adjacency. Moreover, if any two vertices in the different set are adjacency, t
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/29340910660655655168
Autor:
Yuan-Lung Lin, Frederick Kin Hing Phoa
Publikováno v:
Statistica Sinica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80a7995506841bc2bd327f63e953f0ca
https://doi.org/10.5705/ss.202017.0503
https://doi.org/10.5705/ss.202017.0503
Publikováno v:
Statistica Sinica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a1526f32a2878cbcbdb27c6b6d80b10
https://doi.org/10.5705/ss.202016.0254
https://doi.org/10.5705/ss.202016.0254
Publikováno v:
Statistica Sinica; 2021, Vol. 31 Issue 1, p157-171, 29p, 1 Chart
Publikováno v:
Ann. Statist. 45, no. 6 (2017), 2483-2510
Functional magnetic resonance imaging (fMRI) is a pioneering technology for studying brain activity in response to mental stimuli. Although efficient designs on these fMRI experiments are important for rendering precise statistical inference on brain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8e7cb97cf805f5c32c1e45ff317ddf0
https://projecteuclid.org/euclid.aos/1513328580
https://projecteuclid.org/euclid.aos/1513328580
Autor:
Frederick Kin Hing Phoa, Yuan-Lung Lin
Publikováno v:
IIAI-AAI
There is a list of traditional measures on the centrality of a network, but they may provide misleading suggestions when there are more than one center in a network. Even a sequential selection on the centers are performed, the revelation of a truly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec9bf6d5fb1b31958d61f21b7c7b88f2
https://doi.org/10.1109/iiai-aai.2017.155
https://doi.org/10.1109/iiai-aai.2017.155
Publikováno v:
Journal of Advanced Statistics. 2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45dab12d4e4f4ac1bc665571d6ca14e2
https://doi.org/10.22606/jas.2017.22002
https://doi.org/10.22606/jas.2017.22002
Publikováno v:
Statistica Sinica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5ef0d7ef7e42218855842bbe2c006c6
https://doi.org/10.5705/ss.202014.0115
https://doi.org/10.5705/ss.202014.0115
Publikováno v:
Discrete Mathematics. 313:2942-2950
A k -sun graph S ( C k ) is a graph obtained from a k -cycle by adding a pendent edge to each vertex of the k -cycle. A k -sun system of order v is a decomposition of the complete graph K v into k -sun graphs. In this paper, we find the necessary and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::737e83d63abced5fb6604a1fb10ce012
https://doi.org/10.1016/j.disc.2013.09.007
https://doi.org/10.1016/j.disc.2013.09.007