Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Wen-Huan Wang"'
Publikováno v:
Defence Technology, Vol 18, Iss 7, Pp 1097-1106 (2022)
A numerical triangulation and transformation into the time domain of a Kirchhoff approximation (KA) method is proposed for the modeling of bistatic scattering from an underwater non-penetrable target. The time domain solution in this approximation ca
Externí odkaz:
https://doaj.org/article/65efbad66761452a9c19eb74c4424a52
Publikováno v:
Medicine; 3/29/2024, Vol. 103 Issue 13, p1-4, 4p
Autor:
Wen-Huan Wang, Lou-Jun Yu
Publikováno v:
Linear and Multilinear Algebra. :1-22
Publikováno v:
Discrete Applied Mathematics. 322:311-319
Autor:
Cong Cong Sun, Ya Nan Lai, Wen Huan Wang, Xiao Min Xu, Xiao Qing Li, Hai Wang, Jia Yong Zheng, Jian Qiong Zheng
Publikováno v:
Frontiers in Pharmacology, Vol 11 (2020)
Gestational diabetes mellitus (GDM) causes oxidative stress in mothers and infants and causes vascular endothelial dysfunction, which is a key factor for maternal and fetal cardiovascular diseases in the later stage of GDM, seriously threatening the
Externí odkaz:
https://doaj.org/article/ec8ec41490f14ab59b59d4cab7d725ca
Autor:
Wen-Huan Wang, Rui Sun
Publikováno v:
Linear Algebra and its Applications. 649:47-62
Autor:
Jia-Wen Yang, Wen-Huan Wang
Publikováno v:
Discrete Mathematics, Algorithms and Applications.
Let [Formula: see text] be the set of the connected [Formula: see text]-uniform linear hypergraphs with [Formula: see text] vertices, where [Formula: see text]. The matching polynomial of a hypergraph [Formula: see text] is denoted by [Formula: see t
Autor:
Wen-Huan Wang, Ling Yuan
Publikováno v:
Frontiers of Mathematics in China. 15:1211-1229
A supertree is a connected and acyclic hypergraph. We investigate the supertrees with the extremal spectral radii among several kinds of r-uniform supertrees. First, by using the matching polynomials of supertrees, a new and useful grafting operation
Autor:
Wen-Huan Wang
Publikováno v:
Linear and Multilinear Algebra. 70:2898-2918
A supertree is a connected and acyclic hypergraph. Let T m △ , △ be the set of the r-uniform supertrees with m edges and exactly two vertices of maximum degree ▵, where m ≥ 5 and 3 ≤ △ ≤ [ ( m + ...
Autor:
Ling Yuan, Wen-Huan Wang
Publikováno v:
Filomat. 34:3721-3745
Let U?2n be the set of unicyclic signed graphs with perfect matchings having 2n vertices, where ? is a signing function from the edge set of the graphs considered to {-1,1}. The increasing order of the signed graphs among U?2n according to their mini