Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Huifen Ge"'
Publikováno v:
AIMS Mathematics, Vol 8, Iss 10, Pp 24848-24861 (2023)
At present, the reliability of interconnection networks of multiprocessing systems has become a hot topic of research concern for parallel computer systems. Conditional connectivity is an important parameter to measure the reliability of an interconn
Externí odkaz:
https://doaj.org/article/dd126c20e37740eea850023ea489fcc7
Publikováno v:
AIMS Mathematics, Vol 7, Iss 8, Pp 14718-14737 (2022)
The generalized $ \ell $-connectivity $ \kappa_{\ell}(G) $ of a graph $ G $ is a generalization of classical connectivity $ \kappa(G) $ with $ \kappa_{2}(G) = \kappa(G) $. It serves to measure the capability of connection for any $ \ell $ vertices. T
Externí odkaz:
https://doaj.org/article/f84c86125b8e437d8e252a98bb65cc17
Publikováno v:
Theory and Applications of Graphs, Vol 6, Iss 2 (2019)
Let F be a subset of edges and vertices of a graph G. If G-F has no fractional perfect matching, then F is a fractional strong matching preclusion set of G. The fractional strong matching preclusion number is the cardinality of a minimum fractional s
Externí odkaz:
https://doaj.org/article/9eef19b10edc4edebfacf4c40f465346
Autor:
Huifen Ge1 gehuifen11856@163.com, Shumin Zhang2 zhangshumin@qhnu.edu.cn, Chengfu Ye1 yechf@qhnu.edu.cn
Publikováno v:
Interdisciplinary Journal of Discontinuity, Nonlinearity & Complexity. Mar2022, Vol. 11 Issue 1, p1-8. 8p.
Publikováno v:
SIAM Journal on Discrete Mathematics. 36:2323-2338
For all integers $k,d$ such that $k \geq 3$ and $k/2\leq d \leq k-1$, let $n$ be a sufficiently large integer {\rm(}which may not be divisible by $k${\rm)} and let $s\le \lfloor n/k\rfloor-1$. We show that if $H$ is a $k$-uniform hypergraph on $n$ ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b34644013e87f246ea442a12b79af72a
https://doi.org/10.1137/21m1430327
https://doi.org/10.1137/21m1430327
Publikováno v:
AIMS Mathematics; 2023, Vol. 8 Issue 10, p24848-24861, 14p
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e457ac55288c2d22dabe195542bcb6a
https://doi.org/10.2139/ssrn.4002254
https://doi.org/10.2139/ssrn.4002254
Publikováno v:
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering ISBN: 9783030901981
The layout of the processors and links are represented a network structure in a distributed computer system. A graph is regarded as the topological structure of an interconnection network as usual, vertices and edges stand for processors and links be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a0fb0a2f072963bffba75fd68575fd7
https://doi.org/10.1007/978-3-030-90199-8_27
https://doi.org/10.1007/978-3-030-90199-8_27
Publikováno v:
Theory and Applications of Graphs, Vol 6, Iss 2 (2019)
Let F be a subset of edges and vertices of a graph G. If G-F has no fractional perfect matching, then F is a fractional strong matching preclusion set of G. The fractional strong matching preclusion number is the cardinality of a minimum fractional s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7fb312e7816cac79852b3e987076ecc1
https://digitalcommons.georgiasouthern.edu/tag/vol6/iss2/2
https://digitalcommons.georgiasouthern.edu/tag/vol6/iss2/2