首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
5.
《Discrete Mathematics》2022,345(8):112902
For a simple graph G, denote by n, Δ(G), and χ(G) its order, maximum degree, and chromatic index, respectively. A graph G is edge-chromatic critical if χ(G)=Δ(G)+1 and χ(H)<χ(G) for every proper subgraph H of G. Let G be an n-vertex connected regular class 1 graph, and let G? be obtained from G by splitting one vertex of G into two vertices. Hilton and Zhao in 1997 conjectured that G? must be edge-chromatic critical if Δ(G)>n/3, and they verified this when Δ(G)n2(7?1)0.82n. In this paper, we prove it for Δ(G)0.75n.  相似文献   

6.
7.
8.
9.
10.
11.
12.
This paper deals with the chemotaxis-growth system: ut=Δu???(u?v)+μu(1?u), vt=Δv?v+w, τwt+δw=u in a smooth bounded domain Ω?R3 with zero-flux boundary conditions, where μ, δ, and τ are given positive parameters. It is shown that the solution (u,v,w) exponentially stabilizes to the constant stationary solution (1,1δ,1δ) in the norm of L(Ω) as t provided that μ>0 and any given nonnegative and suitably smooth initial data (u0,v0,w0) fulfills u0?0, which extends the condition μ>18δ2 in [8].  相似文献   

13.
14.
15.
16.
《Discrete Mathematics》2022,345(7):112893
In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let Γ and Γ be finite simple graphs with at least three vertices such that there exists a bijective map f:V(Γ)V(Γ) and for any vV(Γ), there exists an isomorphism ?v:Γ?vΓ?f(v). Then we define the associated directed graph Γ?=Γ?(Γ,Γ,f,{?v}vV(Γ)) with two kinds of arrows from the graphs Γ and Γ, the bijective map f and the isomorphisms {?v}vV(Γ). By investigating the associated directed graph Γ?, we study when are the two graphs Γ and Γ isomorphic.  相似文献   

17.
We employ separation of variables to prove weighted resolvent estimates for the semiclassical Schrödinger operator ?h2Δ+V(|x|)?E in dimension n2, where h,E>0, and V:[0,)R is L and compactly supported. The weighted resolvent norm grows no faster than exp?(Ch?1), while an exterior weighted norm grows h?1. We introduce a new method based on the Mellin transform to handle the two-dimensional case.  相似文献   

18.
19.
20.
Let M be a random m×n rank-r matrix over the binary field F2, and let wt(M) be its Hamming weight, that is, the number of nonzero entries of M.We prove that, as m,n+ with r fixed and m/n tending to a constant, we have thatwt(M)12r2mn2r(12r)4(m+n)mn converges in distribution to a standard normal random variable.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号