共查询到20条相似文献,搜索用时 31 毫秒
1.
科学合理的规模结构不仅是实现规模经济的基本条件,而且是提高经济效益、降低交易成本、获得较高的企业竞争力的重要保证.基于规模理论,从生产规模、资本规模、市场规模以及效益规模四大因素入手,提出了一套基于规模的企业竞争力评价指标体系,运用蜘蛛图法建立了基于规模的企业竞争力评价模型,并结合具体的数据分析说明了企业竞争力的大小强弱.此种方法具有直观形象、定量化、可操作性强的特点. 相似文献
2.
DP-coloring of a simple graph is a generalization of list coloring, and also a generalization of signed coloring of signed graphs. It is known that for each , every planar graph without is 4-choosable. Furthermore, Jin et al. (2016) showed that for each , every signed planar graph without is signed 4-choosable. In this paper, we show that for each , every planar graph without is 4-DP-colorable, which is an extension of the above results. 相似文献
3.
两类带有确定潜伏期的SEIS传染病模型的分析 总被引:2,自引:0,他引:2
通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异.对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在.对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的. 相似文献
4.
整环R称为ω-凝聚整环,是指R的每个有限型理想是有限表现型的.本文证明了ω-凝聚整环是v-凝聚整环,且若(RDTF,M)是Milnor方图,则在Ⅰ型情形,R是ω-凝聚整环当且仅当D和T都是ω-整环,且T_M是赋值环;对于Ⅱ-型情形,R是ω-凝聚整环当且仅当D是域,[F:D]<∞,M是R的有限型理想,T是ω-凝聚整环,且R_M是凝聚整环. 相似文献
5.
Zhang Jule 《东北数学》1998,(1)
in this paper, new characteristic properties of strongly regular rings are' given.Relations between certain generalizations of duo rings are also considered. The followingconditions are shown to be equivalent: (1) R is a strongly regular ring; (2) R is a left SFring such that every product of two independent closed left ideals of R is zero; (3) R is aright SF-ring such that every product of two independent closed left ideals of R is zero; (4)R is a left SF-ring whose every special left annihilator is a quasi-ideal; (5) R is a right SFring whose every special left annihilator is a quasi-ideal; (6) R is a left SF-ring whose everymaximal left ideal is a quasi-ideal; (7) R is a right SF-ring whose every maximal left ideal isa quasi-ideal; (8) R is a left SF-ring such that the set N(R) of all nilpotent elements of R isa quasi-ideal; (9) R is a right SF-ring such that N(R) is a quasi-ideal. 相似文献
6.
We discuss dimension theory in the class of all topological groups. For locally compact topological groups there are many classical results in the literature. Dimension theory for non-locally compact topological groups is mysterious. It is for example unknown whether every connected (hence at least 1-dimensional) Polish group contains a homeomorphic copy of . And it is unknown whether there is a homogeneous metrizable compact space the homeomorphism group of which is 2-dimensional. Other classical open problems are the following ones. Let be a topological group with a countable network. Does it follow that ? The same question if is a compact coset space. We also do not know whether the inequality holds for arbitrary topological groups and which are subgroups of -compact topological groups. The aim of this paper is to discuss such and related problems. But we do not attempt to survey the literature. 相似文献
7.
Ts.Ch-D. Batueva O.V. Borodin M.A. Bykov A.O. Ivanova O.N. Kazak D.V. Nikiforov 《Discrete Mathematics》2017,340(11):2659-2664
The weight of an edge in a normal plane map (NPM) is the degree-sum of its end-vertices. An edge is of type if and . In 1940, Lebesgue proved that every NPM has an edge of one of the types , , or , where 7 and 6 are best possible. In 1955, Kotzig proved that every 3-connected planar graph has an edge with , which bound is sharp. Borodin (1989), answering Erd?s’ question, proved that every NPM has either a -edge, or -edge, or -edge.A vertex is simplicial if it is completely surrounded by 3-faces. In 2010, Ferencová and Madaras conjectured (in different terms) that every 3-polytope without simplicial 3-vertices has an edge with . Recently, we confirmed this conjecture by proving that every NPM has either a simplicial 3-vertex adjacent to a vertex of degree at most 10, or an edge of types , , or .By a -vertex we mean a -vertex incident with precisely triangular faces. The purpose of our paper is to prove that every NPM has an edge of one of the following types: , , , , , , or , where all bounds are best possible. In particular, this implies that the bounds in , , and can be attained only at NPMs having a simplicial 3-, 4-, or 5-vertex, respectively. 相似文献
8.
A star edge-coloring of a graph is a proper edge coloring such that every 2-colored connected subgraph of is a path of length at most 3. For a graph , let the list star chromatic index of , , be the minimum such that for any -uniform list assignment for the set of edges, has a star edge-coloring from . Dvo?ák et al. (2013) asked whether the list star chromatic index of every subcubic graph is at most 7. In Kerdjoudj et al. (2017) we proved that it is at most 8. In this paper we consider graphs with any maximum degree, we proved that if the maximum average degree of a graph is less than (resp. 3), then (resp. ). 相似文献
9.
10.
In 1962, Erd?s proved that if a graph with vertices satisfies where the minimum degree and , then it is Hamiltonian. For , let , where “” is the “join” operation. One can observe and is not Hamiltonian. As contains induced claws for , a natural question is to characterize all 2-connected claw-free non-Hamiltonian graphs with the largest possible number of edges. We answer this question completely by proving a claw-free analog of Erd?s’ theorem. Moreover, as byproducts, we establish several tight spectral conditions for a 2-connected claw-free graph to be Hamiltonian. Similar results for the traceability of connected claw-free graphs are also obtained. Our tools include Ryjá?ek’s claw-free closure theory and Brousek’s characterization of minimal 2-connected claw-free non-Hamiltonian graphs. 相似文献
11.
12.
In this article, we study the multiplicity and concentration behavior of positive solutions for the p-Laplacian equation of Schrödinger-Kirchhoff type
in
, where Δp is the p-Laplacian operator, 1 < p < N, M:
and V:
are continuous functions, ε is a positive parameter, and f is a continuous function with subcritical growth. We assume that V satisfies the local condition introduced by M. del Pino and P. Felmer. By the variational methods, penalization techniques, and Lyusternik-Schnirelmann theory, we prove the existence, multiplicity, and concentration of solutions for the above equation. 相似文献
14.
This paper deals with the Cayley graph , where the generating set consists of all block transpositions. A motivation for the study of these particular Cayley graphs comes from current research in Bioinformatics. As the main result, we prove that is the product of the left translation group and a dihedral group of order . The proof uses several properties of the subgraph of induced by the set . In particular, is a -regular graph whose automorphism group is
has as many as maximal cliques of size , and its subgraph whose vertices are those in these cliques is a 3-regular, Hamiltonian, and vertex-transitive graph. A relation of the unique cyclic subgroup of of order with regular Cayley maps on is also discussed. It is shown that the product of the left translation group and the latter group can be obtained as the automorphism group of a non--balanced regular Cayley map on . 相似文献
15.
Juan Li 《Stochastic Processes and their Applications》2018,128(9):3118-3180
In this paper we consider a mean-field backward stochastic differential equation (BSDE) driven by a Brownian motion and an independent Poisson random measure. Translating the splitting method introduced by Buckdahn et al. (2014) to BSDEs, the existence and the uniqueness of the solution , of the split equations are proved. The first and the second order derivatives of the process with respect to , the derivative of the process with respect to the measure , and the derivative of the process with respect to are studied under appropriate regularity assumptions on the coefficients, respectively. These derivatives turn out to be bounded and continuous in . The proof of the continuity of the second order derivatives is particularly involved and requires subtle estimates. This regularity ensures that the value function is regular and allows to show with the help of a new Itô formula that it is the unique classical solution of the related nonlocal quasi-linear integral-partial differential equation (PDE) of mean-field type. 相似文献
16.
S. Morteza Mirafzal 《Discrete Mathematics》2018,341(1):217-220
The Kneser graph has as vertices all -element subsets of and an edge between any two vertices that are disjoint. If , then is called an odd graph. Let and . In the present paper, we show that if the Kneser graph is of even order where is an odd integer or both of the integers are even, then is a vertex-transitive non Cayley graph. Although, these are special cases of Godsil [7], unlike his proof that uses some very deep group-theoretical facts, ours uses no heavy group-theoretic facts. We obtain our results by using some rather elementary facts of number theory and group theory. We show that ‘almost all’ odd graphs are of even order, and consequently are vertex-transitive non Cayley graphs. Finally, we show that if is an even integer such that is not of the form for some , then the line graph of the odd graph is a vertex-transitive non Cayley graph. 相似文献
17.
The purpose of this paper is to study the second-order nonlinear noncanonical differential equation under the condition . Contrary to most existing results, oscillation of the studied equation is attained via only one condition. We consider both delay and advanced differential equations. A particular example of Euler type equation is provided in order to illustrate the significance of our main results. 相似文献
18.
Let be a purely discontinuous additive functional of a subordinate Brownian motion . We give a sufficient condition on the non-negative function that guarantees that finiteness of implies finiteness of its expectation. This result is then applied to study the relative entropy of and the probability measure induced by a purely discontinuous Girsanov transform of the process . We prove these results under the weak global scaling condition on the Laplace exponent of the underlying subordinator. 相似文献
19.
It is trivial that every 3-polytope has a face of degree at most 5, called minor. The height of a face is the maximum degree of the vertices incident with . It follows from the partial double -pyramids that can be arbitrarily large for each if a 3-polytope is allowed to have faces of types or .In 1996, M. Horňák and S. Jendrol’ proved that every 3-polytope without faces of types and has a minor face of height at most 39 and constructed such a 3-polytope satisfying for all minor faces .The purpose of this paper is to prove that every 3-polytope without faces of types and has a minor face of height at most 30, which bound is tight due to the Horňák–Jendrol’ construction. 相似文献
20.
In this paper we obtain new conditions for the global existence and boundedness of solutions for nonlinear second-order equations of the form where is a real constant. The results are applicable to well-known Emden–Fowler and Lienard type equations. An illustrative example is also provided. 相似文献