Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Sizhong Zhou"'
Autor:
Zhiren Sun, Sizhong Zhou
Publikováno v:
Discrete Mathematics Letters, Vol 12, Pp 154-158 (2023)
Externí odkaz:
https://doaj.org/article/7bd6d511c48740a1b4ef67c4c6740e90
Autor:
Sizhong Zhou, Quanru Pan
Publikováno v:
AIMS Mathematics, Vol 6, Iss 2, Pp 1223-1233 (2021)
Let $G$ be a $[0,k_1+k_2+\cdots+k_m-n+1]$-digraph and $H_1,H_2,\cdots,H_r$ be $r$ vertex-disjoint $n$-subdigraphs of $G$, where $m,n,r$ and $k_i$ ($1\leq i\leq m$) are positive integers satisfying $1\leq n\leq m$ and $k_1\geq k_2\geq\cdots\geq k_m\ge
Externí odkaz:
https://doaj.org/article/c1aabc358c79449988836a877dffe6ac
Publikováno v:
AIMS Mathematics, Vol 6, Iss 11, Pp 12460-12470 (2021)
Let $ G $ be a graph. For a set $ \mathcal{H} $ of connected graphs, an $ \mathcal{H} $-factor of a graph $ G $ is a spanning subgraph $ H $ of $ G $ such that every component of $ H $ is isomorphic to a member of $ \mathcal{H} $. A graph $ G $ is ca
Externí odkaz:
https://doaj.org/article/e58d6ca7901d455b9f0d546d7e96af9d
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 3, p 761 (2023)
Externí odkaz:
https://doaj.org/article/2b7ed7f627ca45349b95e5d76092f253
Autor:
Guoyuan Yang, Sizhong Zhou, Jelena Bozek, Hao-Ming Dong, Meizhen Han, Xi-Nian Zuo, Hesheng Liu, Jia-Hong Gao
Publikováno v:
NeuroImage, Vol 206, Iss , Pp 116318- (2020)
Spatial normalization or deformation to a standard brain template is routinely used as a key module in various pipelines for the processing of magnetic resonance imaging (MRI) data. Brain templates are often constructed using MRI data from a limited
Externí odkaz:
https://doaj.org/article/4380aad00283446fad1b78e3354ac22d
Autor:
Sizhong Zhou, Hongxia Liu
Publikováno v:
Linear Algebra and its Applications. 661:149-162
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bf37e24a261959c87c1e4596aa0803b
https://doi.org/10.1016/j.laa.2022.12.018
https://doi.org/10.1016/j.laa.2022.12.018
Publikováno v:
Discrete Applied Mathematics. 319:511-516
In communication networks, the existence of fractional factors can be characterized as the feasibility of data transmission. When some nonadjacent nodes with each other are damaged and a special channel is assigned, the possibility of data transmissi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::451dc91fbb8de3890fc55778a588b41c
https://doi.org/10.1016/j.dam.2021.03.004
https://doi.org/10.1016/j.dam.2021.03.004
Publikováno v:
Discrete Applied Mathematics. 319:183-191
A graph G is P ≥ k -factor deleted if for every edge e ∈ E ( G ) , G contains a P ≥ k -factor that excludes e . We first define the concept of ( P ≥ k , n ) -critical deleted graph, that is, a graph G is ( P ≥ k , n ) -critical deleted if f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31edb7a3ea423232f65fc8f7031de7a6
https://doi.org/10.1016/j.dam.2021.04.012
https://doi.org/10.1016/j.dam.2021.04.012
Autor:
Sizhong Zhou, Qiuxiang Bian
Publikováno v:
RAIRO - Operations Research. 56:2919-2927
A path-factor is a spanning subgraph F of G such that every component of F is a path with at least two vertices. Let k ≥ 2 be an integer. A P≥k-factor of G means a path factor in which each component is a path with at least k vertices. A graph G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2b2d5de7d9b36a6eb603718d8aad20f
https://doi.org/10.1051/ro/2022143
https://doi.org/10.1051/ro/2022143
Autor:
Sizhong Zhou, Hongxia Liu
Publikováno v:
RAIRO - Operations Research.
Let G be a connected graph of even order n. An odd [1,b]-factor of G is a spanning subgraph F of G such that dF(v) ∈ {1,3,5,··· ,b} for any v ∈ V (G), where b is positive odd integer. The distance matrix D(G) of G is a symmetric real matrix wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64a9d25e8f81ab25cf45d045f99d8d7d
https://doi.org/10.1051/ro/2023069
https://doi.org/10.1051/ro/2023069