Zobrazeno 1 - 10
of 1 257
pro vyhledávání: '"Yang, Weihua"'
Let $G$ be a graph. For $x\in V(G)$, let $N(x)=\{y\in V(G)\colon xy\in E(G)\}$. The minimum common degree of $G$, denoted by $\delta_{2}(G)$, is defined as the minimum of $|N(x)\cap N(y)|$ over all non-edges $xy$ of $G$. In 1982, H\"{a}ggkvist showed
Externí odkaz:
http://arxiv.org/abs/2408.05547
Let $G$ be an $n$-vertex triangle-free graph. The celebrated Mantel's theorem showed that $e(G)\leq \lfloor\frac{n^2}{4}\rfloor$. In 1962, Erd\H{o}s (together with Gallai), and independently Andr\'{a}sfai, proved that if $G$ is non-bipartite then $e(
Externí odkaz:
http://arxiv.org/abs/2404.07486
We developed a method to analyze the polarization correlations of two baryons $B_{1}\bar{B}_{2}$ with various spin combinations in the annihilation process. We established spin density matrices for arbitrary spins in standard and Cartesian forms, and
Externí odkaz:
http://arxiv.org/abs/2404.04787
A graph $ G $ is minimally $ t $-tough if the toughness of $ G $ is $ t $ and deletion of any edge from $ G $ decreases its toughness. Katona et al. conjectured that the minimum degree of any minimally $ t $-tough graph is $ \lceil 2t\rceil $ and pro
Externí odkaz:
http://arxiv.org/abs/2311.08634
Kronk introduced the $l$-path hamiltonianicity of graphs in 1969. A graph is $l$-path Hamiltonian if every path of length not exceeding $l$ is contained in a Hamiltonian cycle. We have shown that if $P=uvz$ is a 2-path of a 2-connected, $k$-regular g
Externí odkaz:
http://arxiv.org/abs/2311.05505
Among graphs with 13 edges, there are exactly three internally 4-connected graphs which are $Oct^{+}$, cube+e and $ K_{3,3} +v$. A complete characterization of all 4-connected graphs with no $Oct^{+}$-minor is given in [John Maharry, An excluded mino
Externí odkaz:
http://arxiv.org/abs/2310.12283
Publikováno v:
Hangkong gongcheng jinzhan, Vol 15, Iss 5, Pp 127-134 (2024)
The rubbing of the labyrinth sealing structure is a common problem during the operation of aeroengine air system. Due to the difficulty in observing the process of crack initiation and propagation on the sealing ring during actual rubbing，using fin
Externí odkaz:
https://doaj.org/article/d0f58c8976c24f4fa6bdd2daa916bdcd
Publikováno v:
Guoji Yanke Zazhi, Vol 24, Iss 10, Pp 1563-1568 (2024)
Chronic obstructive pulmonary disease(COPD)is a group of lung diseases characterized by persistent airflow limitation, often accompanied by chronic hypoxia. This chronic hypoxia can lead to structural and functional changes in the walls of blood vess
Externí odkaz:
https://doaj.org/article/5cc9eea5de324a36ad0de791e6cc937d
A graph $G$ is called $C_{2k+1}$-free if it does not contain any cycle of length $2k+1$. In 1981, Haggkvist, Faudree and Schelp showed that every $n$-vertex triangle-free graph with more than $\frac{(n-1)^2}{4}+1$ edges is bipartite. In this paper, w
Externí odkaz:
http://arxiv.org/abs/2307.07962
Autor:
Wu, Junde, Fang, Huihui, Yang, Yehui, Liu, Yuanpei, Gao, Jing, Duan, Lixin, Yang, Weihua, Xu, Yanwu
In medical image segmentation, it is often necessary to collect opinions from multiple experts to make the final decision. This clinical routine helps to mitigate individual bias. But when data is multiply annotated, standard deep learning models are
Externí odkaz:
http://arxiv.org/abs/2212.00601