Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Gui-Dong Yu"'
Publikováno v:
ZooKeys, Vol 1219, Iss , Pp 105-122 (2024)
A new species of the Asian leaf litter toad genus Leptobrachella, L. dayaoshanensis sp. nov., is described based on phylogenetic analysis, morphological characters, and bioacoustic data. This species occurs in the Dayaoshan National Nature Reserve lo
Externí odkaz:
https://doaj.org/article/ffe6762ea3fd4f83a6a217cec123eb6b
Publikováno v:
ZooKeys, Vol 1178, Iss , Pp 1-16 (2023)
A new species of Leptobrachella, L. wumingensis sp. nov., was described from the Damingshan National Nature Reserve, Wuming District, Nanning City, Guangxi, China based on morphological, molecular and bioacoustic data. Phylogenetic analysis of 16S mt
Externí odkaz:
https://doaj.org/article/02627fc1ba194ebf8151c989dc2ca859
Autor:
Wei-Cai Chen, Jian-Ping Ye, Wan-Xiao Peng, Peng Li, Tong-Ping Su, Gui-Dong Yu, Zhi-Ying Cheng
Publikováno v:
ZooKeys, Vol 1135, Iss , Pp 119-137 (2022)
A new species of music frog, Nidirana guibeiensis sp. nov., is described from northern Guangxi, China. Based on two mtDNA fragments analyzed, phylogenetic trees reveal that N. guibeiensis sp. nov. is most closely related to N. leishanensis. However,
Externí odkaz:
https://doaj.org/article/63705289bebb4c1ab37b1b16858b08cb
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2020 (2020)
The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let Un denote the set of unicyclic graphs with n vertices. We st
Externí odkaz:
https://doaj.org/article/ae4d207a8c30489c8fc97d46a5a7b6a2
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2018 (2018)
The Harary index of G is the sum of reciprocals of distance between any two vertices in G. In this paper, we obtain the graphs with the maximum and second-maximum Harary indices among n-vertex unicyclic graphs with diameter d.
Externí odkaz:
https://doaj.org/article/5514cf5148e34930bcac640cce7cb97f
Publikováno v:
Zoological Research. 42:783-788
A new species of the genus Leptobrachella, Leptobrachella damingshanensis sp. nov. is described from central Guangxi, China, based on morphological, molecular, and acoustic data. Phylogenetic analyses using a 16S rRNA gene fragment indicated that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4c53d548e7c7e00c5222aeb95143b48
https://doi.org/10.24272/j.issn.2095-8137.2021.179
https://doi.org/10.24272/j.issn.2095-8137.2021.179
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2020 (2020)
The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let Un denote the set of unicyclic graphs with n vertices. We st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5111ed0e684425cdcfbcdb527cd32ab
https://doi.org/10.1155/2020/7318968
https://doi.org/10.1155/2020/7318968
Publikováno v:
Applied Mathematics-A Journal of Chinese Universities. 34:162-172
In this paper, in terms of Wiener index, hyper-Wiener index and Harary index, we first give some sufficient conditions for a nearly balance bipartite graph with given minimum degree to be traceable. Secondly, we establish some conditions for a k-conn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5aa028208965e4f2c2c664dae358d144
https://doi.org/10.1007/s11766-019-3565-9
https://doi.org/10.1007/s11766-019-3565-9
Publikováno v:
Applied Mathematics and Computation. 331:112-119
Let G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of A(G) are referred to as the eigenvalues of G. In this paper, we characterize the graphs with the minimal least eigenvalue among all graphs whose complements are connect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6b5cc2097cc395ad71cf8c7059e6076
https://doi.org/10.1016/j.amc.2018.02.048
https://doi.org/10.1016/j.amc.2018.02.048
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 21:153-161
In this paper, we establish sufficient conditions for a connected claw-free graph to be traceable in terms of the signless Laplacian spectral radius of the graph or Laplacian eigenvalues of its complements, respectively.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9cd4023cced687208aad9f67f1ee6867
https://doi.org/10.1080/09720529.2016.1266143
https://doi.org/10.1080/09720529.2016.1266143