Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Jianglu Wang"'
Publikováno v:
Frontiers in Ecology and Evolution, Vol 11 (2023)
Engineering projects are confronted with many problems resulting from overbreak in tunnel blasting, necessitating the optimization of design parameters to minimize overbreak. In this study, an AI-based model for overbreak prediction and optimization
Externí odkaz:
https://doaj.org/article/0b4bdc9411644ee385071f1ab7154d03
Autor:
Jianglu Wang, Min Li
Publikováno v:
Discrete Mathematics. 309:4011-4016
A subgraph isomorphic to K"1","p(p>=3) in a graph G is a p-claw of G. A graph G is K"1","p-restricted if for any p-claw H of G the number of the edges in G among vertices of degree 1 in H is at least p-2. Clearly, every claw-free graph is K"1","p-res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2845578ae91189f96b030fe97b3b4923
https://doi.org/10.1016/j.disc.2008.11.035
https://doi.org/10.1016/j.disc.2008.11.035
Autor:
Houyuan Lin, Jianglu Wang
Publikováno v:
Discrete Mathematics. 308:4280-4285
A graph G is called {H"1,H"2,...,H"k}-free if G contains no induced subgraph isomorphic to any H"i, 1==(n-2)/2, then G has a Hamilton path, where K"1","4+e is a graph obtained by joining a pair of nonadjacent vertices in a K"1","4.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e21235daeec75ac4a2547d21296946f8
https://doi.org/10.1016/j.disc.2007.08.051
https://doi.org/10.1016/j.disc.2007.08.051
Publikováno v:
Discrete Mathematics. 306:2010-2015
Let G be a connected, locally connected, claw-free graph of order n and x,y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S∩{x,y}=∅, then each (x,y)-path of length less than n-1 in G is extendable, that is, for any p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::720f85bad2e0be7fa91d7acb3a52baa4
https://doi.org/10.1016/j.disc.2006.03.057
https://doi.org/10.1016/j.disc.2006.03.057
Autor:
Jianglu Wang, Ellen X. Y. Qu
Publikováno v:
Discrete Mathematics. (5):1135-1141
A graph G is called quasi-claw-free if for any two vertices x and y with distance two there exists a vertex u∈N(x)∩N(y) such that N[u]⊆N[x]∪N[y]. This concept is a natural extension of the classical claw-free graphs. In this paper, we present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::692c890debe341c6a4db5b8cb5f9cd7e