Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Pu Qiao"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Pu Qiao, Bo Li, Yuan He, Kaiyuan Shi, Xin Zhang, Jiaqing Zhang, Yanlong Wang, Lei Su, Yongmei Chen, Katsuyoshi Nishinari, Guoqiang Yang
Publikováno v:
The Journal of Physical Chemistry C. 126:21825-21832
Autor:
Pu Qiao, Kaiyuan Shi, Yanlong Wang, Bo Li, Lei Su, Ke Zhang, Katsuyoshi Nishinari, Guoqiang Yang
Publikováno v:
Food Hydrocolloids. 141:108732
Autor:
Wang, Wei-Zhang, Pu, Qiao-Hong, Lin, Xiang-Hua, Liu, Man-Yu, Wu, Li-Rong, Wu, Qing-Qing, Chen, Yong-Heng, Liao, Fen-Fang, Zhu, Jia-Yong, Jin, Xiao-Bao
Publikováno v:
In Leukemia Research October 2015 39(10):1117-1124
Publikováno v:
2022 International Applied Computational Electromagnetics Society Symposium (ACES-China).
Autor:
Xingzhi Zhan, Pu Qiao
Publikováno v:
Czechoslovak Mathematical Journal. 72:365-369
Let L(n, d) denote the minimum possible number of leaves in a tree of order n and diameter d. Lesniak (1975) gave the lower bound B(n,d) = ⌈2(n − 1)/d⌉ for L(n,d). When d is even, B(n,d) = L(n,d). But when d is odd, B(n,d) is smaller than L(n,d
Autor:
Pu Qiao, Xingzhi Zhan
Publikováno v:
Bulletin of the Australian Mathematical Society. 105:177-187
We consider finite simple graphs. Given a graph H and a positive integer $n,$ the Turán number of H for the order $n,$ denoted $\mathrm {ex}(n,H),$ is the maximum size of a graph of order n not containing H as a subgraph. Erdős asked: ‘For which
Autor:
Haotian Yang, Yanlong Wang, Jiaqing Zhang, Jun Kong, Guoqiang Yang, Kaiyuan Shi, Lei Su, Pu Qiao, Li Zhang, Xiao Dong
Publikováno v:
The Journal of Physical Chemistry C. 125:6983-6989
The high-pressure polymorphism of pyridine has attracted great attention. Herein, the crystallization process of pyridine at different compression rates was investigated in detail. When the compres...
Autor:
Wang, Wei-Zhang, Li, Li, Liu, Man-Yu, Jin, Xiao-Bao, Mao, Jian-Wen, Pu, Qiao-Hong, Meng, Min-Jie, Chen, Xiao-Guang, Zhu, Jia-Yong
Publikováno v:
In Life Sciences 14 March 2013 92(6-7):352-358
Autor:
Xingzhi Zhan, Pu Qiao
Publikováno v:
Bulletin of the Australian Mathematical Society. 104:196-202
A graph is called radially maximal if it is not complete and the addition of any new edge decreases its radius. In 1976 Harary and Thomassen proved that the radius $r$ and diameter $d$ of any radially maximal graph satisfy $r\le d\le 2r-2.$ Dutton, M