Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Junqing Cai"'
Publikováno v:
Mathematics, Vol 11, Iss 24, p 4981 (2023)
A graph with n vertices is called an n-graph. A spanning tree with at most k leaves is referred to as a spanning k-ended tree. Spanning k-ended trees are important in various fields such as network design, graph theory, and communication networks. Th
Externí odkaz:
https://doaj.org/article/6c0c26ae9eb34f5487bc0830f8c117c0
Publikováno v:
Opuscula Mathematica, Vol 37, Iss 4, Pp 501-508 (2017)
In 1998, H. Broersma and H. Tuinstra proved that: Given a connected graph \(G\) with \(n\geq 3\) vertices, if \(d(u)+d(v)\geq n-k+1\) for all non-adjacent vertices \(u\) and \(v\) of \(G\) (\(k\geq 1\)), then \(G\) has a spanning tree with at most \(
Externí odkaz:
https://doaj.org/article/c9db5664f947443a8f1230b154a8034d
Publikováno v:
Theoretical Computer Science. 906:76-82
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bcc297ffc2daaf738e0ced0edac1cbd5
https://doi.org/10.1016/j.tcs.2022.01.006
https://doi.org/10.1016/j.tcs.2022.01.006
Publikováno v:
Environmental Progress & Sustainable Energy. 42
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14ac0f5426482b8f0e42324ff8bce362
https://doi.org/10.1002/ep.13970
https://doi.org/10.1002/ep.13970
Publikováno v:
Journal of Mathematical Chemistry. 59:1378-1394
The Harary index of a connected (molecular) graph is defined as the sum of reciprocals of distances between all its pairs of vertices. In this paper, we characterize the extremal Eulerian graphs (with a fixed number of vertices) with greatest and sma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::579157e2c0fa849e25a66df2b4dde4ce
https://doi.org/10.1007/s10910-021-01246-2
https://doi.org/10.1007/s10910-021-01246-2
Publikováno v:
Journal of Materials Research. 36:906-915
Different amounts (0, 1.0, 3.0, 5.0 and 10.0 wt%) of reduced graphene oxide (RGO) were successfully immobilized to the surface of TiO2 nanoparticles through a hydrothermal process. With addition of RGO, the particle size decreased and the surface are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14a8b57bc76e29e2b64cab6ff1b6944b
https://doi.org/10.1557/s43578-021-00154-0
https://doi.org/10.1557/s43578-021-00154-0
Autor:
Junqing Cai, Panpan Wang
Publikováno v:
Discrete Mathematics. 342:1546-1552
A graph G is a K 1 , r -free graph if it contains no induced subgraph isomorphic to K 1 , r . In this paper, we prove that for a connected K 1 , 5 -free graph G , if σ 5 ( G ) ≥ | G | − 1 , then G contains a spanning tree with at most 4 leaves.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::825548b8b62546223e7fea5a1dda6b4c
https://doi.org/10.1016/j.disc.2019.01.027
https://doi.org/10.1016/j.disc.2019.01.027
Publikováno v:
Discrete Mathematics. 341:1160-1165
Let k be a positive integer. In this paper, we prove that for a graph G with at least 4 k vertices, if max { d ( x ) , d ( y ) } ≥ 2 k for any pair of nonadjacent vertices { x , y } ⊆ V ( G ) , then G contains k disjoint cycles. This generalizes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98b766b50acd8721789d4508bf1b72b3
https://doi.org/10.1016/j.disc.2017.09.027
https://doi.org/10.1016/j.disc.2017.09.027
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, 2017, 340 (12), pp.2955-2966. ⟨10.1016/j.disc.2017.07.020⟩
Discrete Mathematics, Elsevier, 2017, 340 (12), pp.2955-2966. ⟨10.1016/j.disc.2017.07.020⟩
Let σ 4 ∗ = min { ∑ i = 1 4 d ( v i ) + | ⋃ i = 1 4 N ( v i ) | − | ⋂ i = 1 4 N ( v i ) | : { v 1 , v 2 , v 3 , v 4 } is an independent set of a graph G } . In this paper, we give a low bound for the length of a longest cycle in a 4-connec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18c9a7fa613e1376622c2d506bd8ba06
https://doi.org/10.1016/j.disc.2017.07.020
https://doi.org/10.1016/j.disc.2017.07.020
Publikováno v:
Catalysis Communications. 98:116-120
Coking and deactivation behavior of ZSM-5 in the isomerization of styrene oxide to phenylacetaldehyde were investigated under gas-phase free of solvents. More soft coke was firstly formed on HZSM-5 and then partly converted to hard coke with the reac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fd7a74c09f6a72f26c8c76d829e78aa
https://doi.org/10.1016/j.catcom.2017.04.035
https://doi.org/10.1016/j.catcom.2017.04.035