Zobrazeno 1 - 10
of 3 216
pro vyhledávání: '"LIU, HONGXIA"'
Let $G$ be a graph and $T$ be a spanning tree of $G$. We use $Q(G)=D(G)+A(G)$ to denote the signless Laplacian matrix of $G$, where $D(G)$ is the diagonal degree matrix of $G$ and $A(G)$ is the adjacency matrix of $G$. The signless Laplacian spectral
Externí odkaz:
http://arxiv.org/abs/2412.00700
Metallic bismuth is both non-toxic and cost-effective. Bi-based catalysts have demonstrated the ability to efficiently produce HCOOH through CO2RR while effectively inhibiting the HER. Although many experiments have been reported concerning its perfo
Externí odkaz:
http://arxiv.org/abs/2409.11648
Let $\alpha\in[0,1)$, and let $G$ be a connected graph of order $n$ with $n\geq f(\alpha)$, where $f(\alpha)=14$ for $\alpha\in[0,\frac{1}{2}]$, $f(\alpha)=17$ for $\alpha\in(\frac{1}{2},\frac{2}{3}]$, $f(\alpha)=20$ for $\alpha\in(\frac{2}{3},\frac{
Externí odkaz:
http://arxiv.org/abs/2403.02896
Let $\alpha\in[0,1)$, and let $G$ be a connected graph of order $n$ with $n\geq f(\alpha)$, where $f(\alpha)=6$ for $\alpha\in[0,\frac{2}{3}]$ and $f(\alpha)=\frac{4}{1-\alpha}$ for $\alpha\in(\frac{2}{3},1)$. A graph $G$ is said to be $t$-tough if $
Externí odkaz:
http://arxiv.org/abs/2402.17421
Autor:
Zhou, Sizhong, Liu, Hongxia
A spanning subgraph $F$ of $G$ is called a path factor if every component of $F$ is a path of order at least 2. Let $k\geq2$ be an integer. A $P_{\geq k}$-factor of $G$ means a path factor in which every component has at least $k$ vertices. A graph $
Externí odkaz:
http://arxiv.org/abs/2304.00937
Publikováno v:
Shanghai yufang yixue, Vol 36, Iss 5, Pp 453-457 (2024)
ObjectiveTo investigate the infestation and disposal of bedbugs in Shanghai， and provide scientific evidence for comprehensive prevention and control of bedbugs.MethodsA questionnaire survey was conducted in the pest control operations （PCOs） o
Externí odkaz:
https://doaj.org/article/453efa2ba23948db8a3e59ee9a77ef95
For a set $\mathcal{H}$ of connected graphs, a spanning subgraph $H$ of $G$ is called an $\mathcal{H}$-factor of $G$ if each component of $H$ is isomorphic to an element of $\mathcal{H}$. A graph $G$ is called an $\mathcal{H}$-factor uniform graph if
Externí odkaz:
http://arxiv.org/abs/2204.09842
Autor:
Liu, Hongxia, Pan, Xiaogang
Publikováno v:
In Discrete Applied Mathematics 31 December 2024 359:153-158
Publikováno v:
In Discrete Applied Mathematics 15 December 2024 358:358-365
Autor:
Zhan, Changlin, Wan, Dejun, Han, Yongming, Zhang, Jiaquan, Liu, Shan, Liu, Hongxia, Hu, Tianpeng, Xiao, Wensheng, Cao, Junji, Li, Dong
Publikováno v:
In Catena December 2024 247