Zobrazeno 1 - 10
of 807
pro vyhledávání: '"Liu Lele"'
Publikováno v:
Geoenvironmental Disasters, Vol 10, Iss 1, Pp 1-14 (2023)
Abstract Background Uneven settlement will occur as a result of the collapsible deformation of the loess strata, and the hydraulic tunnel lining structure will also fail. In this work, laterally confined compression tests were carried out on loess an
Externí odkaz:
https://doaj.org/article/1e54e32bb5eb4ef3b85c3ab8a42d5e58
Autor:
GAO Yushao (高玉韶), FENG Yanqiong (冯燕琼), ZHANG Liping (张丽平), LIU Lele (刘乐乐), LIANG Sufang (梁素芳), LIANG Miaozhen (梁妙珍)
Publikováno v:
中西医结合护理, Vol 7, Iss 8, Pp 109-114 (2021)
Objective To explore the effect of PDCA cycle in the early rehabilitation nursing of patients with acute ischemic stroke. Methods Totally 65 patients with acute ischemic stroke received from February to October 2019 were included as the control group
Externí odkaz:
https://doaj.org/article/1c7eafce3d5741b998ec8db34f24dd42
The spectral Tur\'an theorem states that the $k$-partite Tur\'an graph is the unique graph attaining the maximum adjacency spectral radius among all graphs of order $n$ containing no the complete graph $K_{k+1}$ as a subgraph. This result is known to
Externí odkaz:
http://arxiv.org/abs/2408.03122
Publikováno v:
Journal of Nematology, Vol 51, Iss 1, Pp 1-13 (2019)
Ektaphelenchus koreanus n. sp. is isolated from Pinus packaging wood from Korea in Ningbo customs. The new species can be characterized by having four incisures in the lateral field, the excretory pore located posterior to nerve ring, female devoid o
Externí odkaz:
https://doaj.org/article/30244a367075410b8046cdaa7b09ca18
Autor:
Lan, Jingfen, Liu, Lele
Let $G$ be a simple connected graph of order $n$ and $\partial(G)$ is the spectral radius of the distance matrix $D(G)$ of $G$. The transmission $D_i$ of vertex $i$ is the $i$-th row sum of $D(G)$. Denote by $D_{\max}(G)$ the maximum of transmissions
Externí odkaz:
http://arxiv.org/abs/2402.00416
Publikováno v:
Journal of Nematology, Vol 52, Iss i_current (2020)
Externí odkaz:
https://doaj.org/article/a113f67afe87481c9d0ef91542297dbd
In 2002, Nikiforov proved that for an $n$-vertex graph $G$ with clique number $\omega$ and edge number $m$, the spectral radius $\lambda(G)$ satisfies $\lambda (G) \leq \sqrt{2(1 - 1/\omega) m}$, which confirmed a conjecture implicitly suggested by E
Externí odkaz:
http://arxiv.org/abs/2312.16138
Autor:
Bindi, Giovanni, Demerlé, Nils, Diaz, Rodrigo, Genova, David, Golvet, Aliénor, Hayes, Ben, Huang, Jiawen, Liu, Lele, Martos, Vincent, Nabi, Sarah, Pelinski, Teresa, Renault, Lenny, Sarkar, Saurjya, Sarmento, Pedro, Vahidi, Cyrus, Wolstanholme, Lewis, Zhang, Yixiao, Roebel, Axel, Bryan-Kinns, Nick, Giavitto, Jean-Louis, Barthet, Mathieu
Artificial Intelligence (AI) technologies such as deep learning are evolving very quickly bringing many changes to our everyday lives. To explore the future impact and potential of AI in the field of music and sound technologies a doctoral day was he
Externí odkaz:
http://arxiv.org/abs/2310.18320
Let $F$ be a graph and $\SPEX (n, F)$ be the class of $n$-vertex graphs which attain the maximum spectral radius and contain no $F$ as a subgraph. Let $\EX (n, F)$ be the family of $n$-vertex graphs which contain maximum number of edges and no $F$ as
Externí odkaz:
http://arxiv.org/abs/2307.14629
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory, covering a ran
Externí odkaz:
http://arxiv.org/abs/2305.10290