首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 109 毫秒
1.
An L(3,2,1)-labeling of a graph G is a function f from the vertex set V(G) to the set of all non-negative integers(labels) such that |f(u)-f(v)|≥3 if d(u,v)=1,|f(u)-f(v)≥2 if d(u,v)=2 and |f(u)-f(v)|≥1 if d(u,v)=3.For a non-negative integer k,a k-L(3,2,1)-labeling is an L(3,2,1)-labeling such that no label is greater than k.The L(3,2,1)-labeling number of G,denoted by λ_(3,2,1)(G), is the smallest number k such that G has a k-L(3,2,1)-labeling.In this article,we characterize the L(3,2,1)-labeling numbers of trees with diameter at most 6.  相似文献   

2.
For positive integers j and k with j ≥ k, an L(j, k)-labeling of a graph G is an assignment of nonnegative integers to V(G) such that the difference between labels of adjacent vertices is at least j, and the difference between labels of vertices that are distance two apart is at least k. The span of an L(j, k)-labeling of a graph G is the difference between the maximum and minimum integers it uses. The λj, k-number of G is the minimum span taken over all L(j, k)-labelings of G. An m-(j, k)-circular labeling of a graph G is a function f : V(G) →{0, 1, 2,..., m - 1} such that |f(u) - f(v)|m ≥ j if u and v are adjacent; and |f(u) - f(v)|m 〉 k ifu and v are at distance two, where |x|m = min{|xl|, m-|x|}. The minimum integer m such that there exists an m-(j, k)-circular labeling of G is called the σj,k-number of G and is denoted by σj,k(G). This paper determines the σ2,1-number of the Cartesian product of any three complete graphs.  相似文献   

3.
邵振东 《东北数学》2006,22(2):181-187
An L(2,1)-labeling of a graph G is a function f from the vertex set V(G) to the set of all nonnegative integers such that |f(x)-f(y)|(?)2 if d(x, y)=1 and |f(x)-f(y)|(?)1 if d(x,y)=2. The L(2,1)-labeling numberλ(G) of G is the smallest number k such that G has an L(2,1)-labeling with max{f(v) : v∈V(G)}=k. We study the L(3,2,1)-labeling which is a generalization of the L(2,1)-labeling on the graph formed by the (Cartesian) product and composition of 3 graphs and derive the upper bounds ofλs(G) of the graph.  相似文献   

4.
An L(2,1)-labelling of a graph G is a function from the vertex set V (G) to the set of all nonnegative integers such that |f(u) f(v)| ≥ 2 if d G (u,v)=1 and |f(u) f(v)| ≥ 1 if d G (u,v)=2.The L(2,1)-labelling problem is to find the smallest number,denoted by λ(G),such that there exists an L(2,1)-labelling function with no label greater than it.In this paper,we study this problem for trees.Our results improve the result of Wang [The L(2,1)-labelling of trees,Discrete Appl.Math.154 (2006) 598-603].  相似文献   

5.
Let G be a simple graph.An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color.Let C(u) be the set of colors of vertex u and edges incident to u under f.For an IE-total coloring f of G using k colors,if C(u)=C(v) for any two different vertices u and v of V(G),then f is called a k-vertex-distinguishing IE-total-coloring of G,or a k-VDIET coloring of G for short.The minimum number of colors required for a VDIET coloring of G is denoted by χ ie vt (G),and it is called the VDIET chromatic number of G.We will give VDIET chromatic numbers for complete bipartite graph K4,n (n≥4),K n,n (5≤ n ≤ 21) in this article.  相似文献   

6.
Let G be a simple graph.An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color.Let C(u) be the set of colors of vertex u and edges incident to u under f.For an IE-total coloring f of G using k colors,if C(u)=C(v) for any two different vertices u and v of V(G),then f is called a k-vertex-distinguishing IE-total-coloring of G,or a k-VDIET coloring of G for short.The minimum number of colors required for a VDIET coloring of G is denoted by χ ie vt (G),and it is called the VDIET chromatic number of G.We will give VDIET chromatic numbers for complete bipartite graph K4,n (n≥4),K n,n (5≤ n ≤ 21) in this article.  相似文献   

7.
Let G be a simple graph. An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring f of G using k colors, if C(u)=C(v) for any two different vertices u and v of V (G), then f is called a k-vertex-distinguishing IE-total-coloring of G, or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χievt(G), and is called the VDIET chromatic number of G. We get the VDIET chromatic numbers of cycles and wheels, and propose related conjectures in this paper.  相似文献   

8.
An L(3, 2, 1)-labeling of a graph G is a function from the vertex set V(G) to the set of all nonnegative integers such that |f(u)-f(v)|≥3 if dG(u,v) = 1, |f(u)-f(v)|≥2 if dG(u,v) = 2, and |f(u)-f(v)|≥1 if dG(u,v) = 3. The L(3, 2,1)-labeling problem is to find the smallest number λ3(G) such that there exists an L(3, 2,1)-labeling function with no label greater than it. This paper studies the problem for bipartite graphs. We obtain some bounds of λ3 for bipartite graphs and its subclasses. Moreover, we provide a best possible condition for a tree T such that λ3(T) attains the minimum value.  相似文献   

9.
I. Cahit calls a graph H-cordial if it is possible to label the edges with the numbers from the set{1,-1} in such a way that, for some k, at each vertex v the sum of the labels on the edges incident with v is either k or-k and the inequalities |v(k)-v(-k)| ≤ 1 and|e(1)-e(-1)| ≤ 1 are also satisfied. A graph G is called to be semi-H-cordial, if there exists a labeling f, such that for each vertex v, |f(v)| ≤ 1, and the inequalities |e_f(1)-e_f(-1)| ≤ 1 and |vf(1)-vf(-1)| ≤ 1 are also satisfied. An odd-degree(even-degree) graph is a graph that all of the vertex is odd(even) vertex. Three conclusions were proved:(1) An H-cordial graph G is either odd-degree graph or even-degree graph;(2) If G is an odd-degree graph, then G is H-cordial if and only if |E(G)| is even;(3) A graph G is semi-H-cordial if and only if |E(G)| is even and G has no Euler component with odd edges.  相似文献   

10.
Let G be a simple graph of order at least 2.A VE-total-coloring using k colors of a graph G is a mapping f from V (G) E(G) into {1,2,···,k} such that no edge receives the same color as one of its endpoints.Let C(u)={f(u)} {f(uv) | uv ∈ E(G)} be the color-set of u.If C(u)=C(v) for any two vertices u and v of V (G),then f is called a k-vertex-distinguishing VE-total coloring of G or a k-VDVET coloring of G for short.The minimum number of colors required for a VDVET coloring of G is denoted by χ ve vt (G) and it is called the VDVET chromatic number of G.In this paper we get cycle C n,path P n and complete graph K n of their VDVET chromatic numbers and propose a related conjecture.  相似文献   

11.
We are concerned with the global existence of entropy solutions of the twodimensional steady Euler equations for an ideal gas, which undergoes a one-step exothermic chemical reaction under the Arrhenius-type kinetics. The reaction rate function φ(T) is assumed to have a positive lower bound. We first consider the Cauchy problem(the initial value problem), that is, seek a supersonic downstream reacting flow when the incoming flow is supersonic, and establish the global existence of entropy solutions when the total variation of the initial data is suffciently small. Then we analyze the problem of steady supersonic, exothermically reacting Euler flow past a Lipschitz wedge, generating an additional detonation wave attached to the wedge vertex, which can be then formulated as an initial-boundary value problem. We establish the global existence of entropy solutions containing the additional detonation wave(weak or strong, determined by the wedge angle at the wedge vertex) when the total variation of both the slope of the wedge boundary and the incoming flow is suitably small. The downstream asymptotic behavior of the global solutions is also obtained.  相似文献   

12.
We study the initial-boundary value problem of the Navier-Stokes equations for incompressible fluids in a general domain in R^n with compact and smooth boundary, subject to the kinematic and vorticity boundary conditions on the non-flat boundary. We observe that, under the nonhomogeneous boundary conditions, the pressure p can be still recovered by solving the Neumann problem for the Poisson equation. Then we establish the well-posedness of the unsteady Stokes equations and employ the solution to reduce our initial-boundary value problem into an initial-boundary value problem with absolute boundary conditions. Based on this, we first establish the well-posedness for an appropriate local linearized problem with the absolute boundary conditions and the initial condition (without the incompressibility condition), which establishes a velocity mapping. Then we develop apriori estimates for the velocity mapping, especially involving the Sobolev norm for the time-derivative of the mapping to deal with the complicated boundary conditions, which leads to the existence of the fixed point of the mapping and the existence of solutions to our initial-boundary value problem. Finally, we establish that, when the viscosity coefficient tends zero, the strong solutions of the initial-boundary value problem in R^n(n ≥ 3) with nonhomogeneous vorticity boundary condition converge in L^2 to the corresponding Euler equations satisfying the kinematic condition.  相似文献   

13.
Let P be a parabolic subalgebra of a general linear Lie algebra gl(n, F) over a field F, where n ≥ 3, F contains at least n different elements, and char(F) = 2. In this article, we prove that generalized derivations, quasiderivations, and product zero derivations of P coincide, and any generalized derivation of P is a sum of an inner derivation, a central quasiderivation, and a scalar multiplication map of P. We also show that any commuting automorphism of P is a central automorphism, and any commuting derivation of P is a central derivation.  相似文献   

14.
The main purpose of this paper is two-fold:(i) to generalize an existence result for a compressible gas-liquid model with a friction term recently published by Friis and Evje [SIAM J. Appl. Math., 71(2011), pp. 2014–2047];(ii) to derive a uniqueness result for the same model. A main ingredient in the existence part is the observation that we can consider weaker assumptions on the initial liquid and gas mass, and still obtain an existence result. Compared to the above mentioned work, we rely on a more refined application of the estimates provided by the basic energy estimate. Concerning the uniqueness result, we borrow ideas from Fang and Zhang [Nonlinear Anal. TMA, 58(2004), pp. 719–731] and derive a stability result under appropriate constraints on parameters that determine rate of decay toward zero at the boundary for gas and liquid masses, and growth rate of masses associated with the friction term and viscous coefficient.  相似文献   

15.
We consider a parametric Dirichlet problem driven by the p-Laplacian with a Carath′eodory reaction of equidiffusive type. Our hypotheses incorporate as a special case the equidiffusive p-logistic equation. We show that if λ1 0 is the principal eigenvalue of the Dirichlet negative p-Laplacian and λ λ1(λ being the parameter), the problem has a unique positive solution, while for λ∈(0,λ1], the problem has no positive solution.  相似文献   

16.
We study the problem of parameter estimation for mean-reverting α-stable motion, dXt = (a0 - θ0Xt)dt + dZt, observed at discrete time instants. A least squares estimator is obtained and its asymptotics is discussed in the singular case (a0, θ0) = (0, 0). If a0 = 0, then the mean-reverting α-stable motion becomes Ornstein-Uhlenbeck process and is studied in [7] in the ergodic case θ0 〉 0. For the Ornstein-Uhlenbeck process, asymptotics of the least squares estimators for the singular case (θ0 = 0) and for ergodic case (θ0 〉 0) are completely different.  相似文献   

17.
In this paper we study the equations governing the unsteady motion of an incompressible homogeneous generalized second grade fluid subject to periodic boundary conditions. We establish the existence of global-in-time strong solutions for shear thickening flows in the two and three dimensional case. We also prove uniqueness of such solution without any smallness condition on the initial data or restriction on the material moduli.  相似文献   

18.
In this paper, we study the boundary-value problem for mixed type equation with singular coefficient. We prove the unique solvability of the mentioned problem with the help of the extremum principle. The proof of the existence is based on the theory of singular integral equations, Wiener-Hopf equations and Fredholm integral equations.  相似文献   

19.
In this paper, a reactive dynamic user equilibrium model is extended to simulate two groups of pedestrians traveling on crossing paths in a continuous walking facility. Each group makes path choices to minimize the travel cost to its destination in a reactive manner based on instantaneous information. The model consists of a conservation law equation coupled with an Eikonal-type equation for each group. The velocity-density relationship of pedestrian movement is obtained via an experimental method. The model is solved using a finite volume method for the conservation law equation and a fast-marching method for the Eikonal-type equation on unstructured grids. The numerical results verify the rationality of the model and the validity of the numerical method. Based on this continuum model, a number of results, e.g., the formation of strips or moving clusters composed of pedestrians walking to the same destination, are also observed.  相似文献   

20.
In this article we bounded symmetric domains study holomorphic isometries of the Poincare disk into Earlier we solved the problem of analytic continuation of germs of holomorphic maps between bounded domains which are isometrics up to normalizing constants with respect to the Bergman metric, showing in particular that the graph 170 of any germ of holomorphic isometry of the Poincar6 disk A into an irreducible bounded symmetric domain Ω belong to C^N in its Harish-Chandra realization must extend to an affinealgebraic subvariety V belong to C × C^N = C^N+1, and that the irreducible component of V ∩ (△ × Ω) containing V0 is the graph of a proper holomorphic isometric embedding F : A→ Ω. In this article we study holomorphie isometric embeddings which are asymptotically geodesic at a general boundary point b ∈ δ△. Starting with the structural equation for holomorphic isometrics arising from the Gauss equation, we obtain by covariant differentiation an identity relating certain holomorphic bisectional curvatures to the boundary behavior of the second fundamental form σ of the holomorphie isometric embedding. Using the nonpositivity of holomorphic bisectional curvatures on a bounded symmetric domain, we prove that ‖σ‖ must vanish at a general boundary point either to the order 1 or to the order 1/2, called a holomorphie isometry of the first resp. second kind. We deal with special cases of non-standard holomorphic isometric embeddings of such maps, showing that they must be asymptotically totally geodesic at a general boundary point and in fact of the first kind whenever the target domain is a Cartesian product of complex unit balls. We also study the boundary behavior of an example of holomorphic isometric embedding from the Poincare disk into a Siegel upper half-plane by an explicit determination of the boundary behavior of holomorphic sectional curvatures in the directions tangent to the embedded Poincare disk, showing that the map is indeed asymptotically totally geodesic at a general boundary point and of the first kind. For the metric computation we make use of formulas for symplectic geometry on Siegel upper half-planes.  相似文献   

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

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