首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
Let G be a simple connected graph of order n   with degree sequence d1,d2,…,dnd1,d2,,dn in non-increasing order. The signless Laplacian spectral radius ρ(Q(G))ρ(Q(G)) of G   is the largest eigenvalue of its signless Laplacian matrix Q(G)Q(G). In this paper, we give a sharp upper bound on the signless Laplacian spectral radius ρ(Q(G))ρ(Q(G)) in terms of didi, which improves and generalizes some known results.  相似文献   

4.
5.
Let I={i1,…,in}I={i1,,in} be a set of voters (players) and A={a1,…,ap}A={a1,,ap} be a set of candidates (outcomes). Each voter i∈IiI has a preference Pi over the candidates. We assume that Pi is a complete order on A  . The preference profile P={Pi,i∈I}P={Pi,iI} is called a situation. A situation is called war if the set of all voters I is partitioned in two coalitions K1 and K2 such that all voters of Ki have the same preference, i=1,2,i=1,2, and these two preferences are opposite. For a simple class of veto voting schemes we prove that the results of elections in all war situations uniquely define the results for all other (peace) situations. In other words, the results depend only on the veto (or effectivity) function. We give several other examples from game (and from graph) theory with the same property.  相似文献   

6.
7.
8.
Given k   pairs of vertices (si,ti)(si,ti)(1≤i≤k)(1ik) of a digraph G, how can we test whether there exist k   vertex-disjoint directed paths from sisi to titi for 1≤i≤k1ik? This is NP-complete in general digraphs, even for k=2k=2 [2], but for k=2k=2 there is a polynomial-time algorithm when G is a tournament (or more generally, a semicomplete digraph), due to Bang-Jensen and Thomassen [1]. Here we prove that for all fixed k there is a polynomial-time algorithm to solve the problem when G is semicomplete.  相似文献   

9.
10.
For any finite-dimensional Hopf algebra H   we construct a group homomorphism BiGal(H)→BrPic(Rep(H))BiGal(H)BrPic(Rep(H)), from the group of equivalence classes of H  -biGalois objects to the group of equivalence classes of invertible exact Rep(H)Rep(H)-bimodule categories. We discuss the injectivity of this map. We exemplify in the case H=TqH=Tq is a Taft Hopf algebra and for this we classify all exact indecomposable Rep(Tq)Rep(Tq)-bimodule categories.  相似文献   

11.
12.
Denote by D(G)=(di,j)n×nD(G)=(di,j)n×n the distance matrix of a connected graph G with n   vertices, where dijdij is equal to the distance between vertices vivi and vjvj in G  . The least eigenvalue of D(G)D(G) is called the least distance eigenvalue of G  , denoted by λnλn. In this paper, we determine all the graphs with λn∈[−2.383,0]λn[2.383,0].  相似文献   

13.
14.
Let M be a 3-connected binary matroid and let n   be an integer exceeding 2. Ding, Oporowski, Oxley, and Vertigan proved that there is an integer f(n)f(n) so that if |E(M)|>f(n)|E(M)|>f(n), then M has a minor isomorphic to one of the rank-n wheel, the rank-n   tipless binary spike, or the cycle or bond matroid of K3,nK3,n. This result was recently extended by Chun, Oxley, and Whittle to show that there is an integer g(n)g(n) so that if |E(M)|>g(n)|E(M)|>g(n) and x∈E(M)xE(M), then x is an element of a minor of M isomorphic to one of the rank-n wheel, the rank-n   binary spike with a tip and a cotip, or the cycle or bond matroid of K1,1,1,nK1,1,1,n. In this paper, we prove that, for each i   in {2,3}{2,3}, there is an integer hi(n)hi(n) so that if |E(M)|>hi(n)|E(M)|>hi(n) and Z is an i-element rank-2 subset of M, then M has a minor from the last list whose ground set contains Z.  相似文献   

15.
16.
The parabolic equation with the control parameter is a class of parabolic inverse problems and is nonlinear. While determining the solution of the problems, we shall determinate some unknown control parameter. These problems play a very important role in many branches of science and engineering. The article is devoted to the following parabolic initial-boundary value problem with the control parameter: ∂u/∂t=∂2u/∂x2+p(t)u+?(x,t),0<x<1,0<t?Tu/t=2u/x2+p(t)u+?(x,t),0<x<1,0<t?T satisfying u(x,0)=f(x),0<x<1u(x,0)=f(x),0<x<1; u(0,t)=g0(t)u(0,t)=g0(t), u(1,t)=g1(t)u(1,t)=g1(t), u(x,t)=E(t),0?t?Tu(x,t)=E(t),0?t?T where ?(x,t),f(x),g0(t),g1(t)?(x,t),f(x),g0(t),g1(t) and E(t)E(t) are known functions, u(x,t)u(x,t) and p(t)p(t) are unknown functions. A linearized compact difference scheme is constructed. The discretization accuracy of the difference scheme is two order in time and four order in space. The solvability of the difference scheme is proved. Some numerical results and comparisons with the difference scheme given by Dehghan are presented. The numerical results show that the linearized difference scheme of this article improve the accuracy of the space and time direction and shorten computation time largely. The method in this article is also applicable to the two-dimensional inverse problem.  相似文献   

17.
We construct an explicit representation of viscosity solutions of the Cauchy problem for the Hamilton–Jacobi equation (H,σ)(H,σ) on a given domain Ω=(0,T)×RnΩ=(0,T)×Rn. It is known that, if the Hamiltonian H=H(t,p)H=H(t,p) is not a convex (or concave) function in p  , or H(⋅,p)H(,p) may change its sign on (0,T)(0,T), then the Hopf-type formula does not define a viscosity solution on Ω  . Under some assumptions for H(t,p)H(t,p) on the subdomains (ti,ti+1)×Rn⊂Ω(ti,ti+1)×RnΩ, we are able to arrange “partial solutions” given by the Hopf-type formula to get a viscosity solution on Ω. Then we study the semiconvexity of the solution as well as its relations to characteristics.  相似文献   

18.
In line with the Concentration–Compactness Principle due to P.-L. Lions [19], we study the lack of compactness of Sobolev embedding of W1,n(Rn)W1,n(Rn), n?2n?2, into the Orlicz space LΦαLΦα determined by the Young function Φα(s)Φα(s) behaving like eα|s|n/(n−1)−1eα|s|n/(n1)1 as |s|→+∞|s|+. In the light of this result we also study existence of ground state solutions for a class of quasilinear elliptic problems involving critical growth of the Trudinger–Moser type in the whole space RnRn.  相似文献   

19.
For a locally compact group G   and 1<p<∞1<p< let Ap(G)Ap(G) be the Figà-Talamanca–Herz algebras, which include in particular the Fourier algebra of G  , A(G)A(G) (p=2p=2). It is shown that for any amenable group H  , a proper affine map α:Y⊂H→Gα:YHG induces a p  -completely contractive algebra homomorphism ?α:Ap(G)→Ap(H)?α:Ap(G)Ap(H) by setting ?α(u)=u°α?α(u)=u°α on Y   and ?α(u)=0?α(u)=0 off of Y. Moreover, we show that if both G and H are amenable then any p  -completely contractive algebra homomorphism ?:Ap(G)→Ap(H)?:Ap(G)Ap(H) is of this form. These results are the analogs in the context of the Figà-Talamanca–Herz algebras of the ones in the Fourier algebra setting (p=2p=2) initiated by the author and continued with N. Spronk, which in turn generalize results of P.J. Cohen and B. Host from abelian group algebra setting.  相似文献   

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

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