Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Junlei Zhu"'
Publikováno v:
AIMS Mathematics, Vol 8, Iss 7, Pp 17081-17090 (2023)
A $ k $-injective-coloring of a graph $ G $ is a mapping $ c: \; V\left(G \right) \to \left\{ {1, 2, \cdots, k} \right\} $ such that $ c\left(u \right) \ne c\left(v \right) $ for any two vertices $ u $ and $ v $ if $ u $ and $ v $ have a common verte
Externí odkaz:
https://doaj.org/article/07c7e662141245dea28049703f8ce922
Publikováno v:
AIMS Mathematics, Vol 7, Iss 6, Pp 10828-10841 (2022)
An acyclic edge coloring of a graph $ G $ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of $ G $, denoted by $ \chi^{'}_{a}(G) $, is the smallest integer $ k $ such that $ G $ is acyclically edge
Externí odkaz:
https://doaj.org/article/59172afb22624382a4fe33493643cc40
Publikováno v:
IEEE Access, Vol 7, Pp 142488-142497 (2019)
Crowd psychology is a critical factor when considering information diffusion, which has been modeled as composed influence. The composed influence is represented as a hyperedge in a graph model. A hyperedge e = (He, v) contains the head node set He a
Externí odkaz:
https://doaj.org/article/35ecd103099f4d349b3404173511e358
Autor:
Junlei Zhu
Publikováno v:
Abstract and Applied Analysis, Vol 2013 (2013)
The inviscid limit problem for the smooth solutions of the Boussinesq system is studied in this paper. We prove the Hs convergence result of this system as the diffusion and the viscosity coefficients vanish with the initial data belonging to Hs. Mor
Externí odkaz:
https://doaj.org/article/b9ff3fd5b42c46e3ae24c8a91dee462c
Autor:
Junlei Zhu
Publikováno v:
Discrete Applied Mathematics. 334:119-126
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1effc57f6ece279e9912af26635352c5
https://doi.org/10.1016/j.dam.2023.03.022
https://doi.org/10.1016/j.dam.2023.03.022
Publikováno v:
Academic Journal of Science and Technology. 2:17-25
In the time trial, the rider should organize his/her power wisely so that he/she can minimize the time for the entire contest. In order to design the optimal power output strategy for different riders in different road situations , we build a model t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2283061fa1e9d9f12e3b6a26089401a7
https://doi.org/10.54097/ajst.v2i2.1072
https://doi.org/10.54097/ajst.v2i2.1072
Publikováno v:
Journal of Combinatorial Optimization. 45
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f4be671adeadb8551e5fde5fb77cce6
https://doi.org/10.1007/s10878-022-00985-5
https://doi.org/10.1007/s10878-022-00985-5
Publikováno v:
Journal of Combinatorial Optimization. 45
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f39455e6ea34662b960504446295ca7d
https://doi.org/10.1007/s10878-022-00972-w
https://doi.org/10.1007/s10878-022-00972-w
Publikováno v:
Journal of Combinatorial Optimization. 44:2748-2761
G has a list k-L(2, 1)-labeling if for any k-list assignment L, there exists a coloring $$c:V(G)\rightarrow \bigcup \limits _{v\in V} L(v)$$ of G such that $$c(v)\in L(v)$$ for $$\forall v\in V(G)$$ and for $$\forall u,v\in V(G)$$ , $$|c(u)-c(v)|\ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be86923416c67900bc99b32f5a3bc63c
https://doi.org/10.1007/s10878-021-00791-5
https://doi.org/10.1007/s10878-021-00791-5
Publikováno v:
Theoretical Computer Science. 857:114-122
An injective k-coloring of a graph G is a mapping f : V ( G ) → { 1 , 2 , … , k } such that for any two vertices v 1 , v 2 ∈ V ( G ) , f ( v 1 ) ≠ f ( v 2 ) if N ( v 1 ) ∩ N ( v 2 ) ≠ ∅ . The injective chromatic number of a graph G, den
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44f58f730c1f9580dec88cd28a69568c
https://doi.org/10.1016/j.tcs.2021.01.007
https://doi.org/10.1016/j.tcs.2021.01.007