LOCALLY SPARSE GRAPH WITH LARGE DENSITY

Using a technique of Erdos, we show that for any given M > 0 and (?) > 0, there exist δ = δ(M, (?)) > 0 and a graph G of any large order n such that the density of G is at least M, while the density of the subgraph induced by any subset U (?) V(G) with |U| ≤ δn is less than 1 (?). The constant 1 (?) cannot be improved to 1.     

FORBIDDEN SUBGRAPHS,DEGREES,NEIGHBORHOOD UNIONS AND CIRCUMFERENCES OF GRAPHS

Combining forbidden subgraphs with degree restrictions and neighborhood unionrestrictions,respectively,we prove the following results:(1) Let G be a 2-connected graph of order n,and 3≤c≤n.If for each induced subgraphL of order four of G(?)|V_1(L)∩S_c|≥2 if L≌K_(1,3),and |V(L)∩S_c|≥1 if L≌P_4,then thecircumference of G is at least c,where V_1(L)is the set of vertices with degree 1 of L,S_c isthe set of vertices with degree at least c/2 of G and P_4 is a path of order 4.(2) Let G be a 2-connected graph of order n,and n≥s+2.If for each induced subgraphL of G isomorphic to K_(1,3)or P_4,d_L(u,v)=2(?)|N(u)∪N(v)|≥s,then the circumferencec (G) of G is at least s+2.Moreover,if n≥s+3 and s is odd,then c(G)≥s+3.     

A FURTHER GENERALIZATION OF JUNG''''S THEOREM

Let G be a graph of order n. We define the distance between two vertices u andv in G, denoted by d(u, v), as the minimum value of the lengths of all u-v paths. We writeσ_k(G)=min{∑_i=1~k d(v_i)|{v_1, v_2,…, v_k} is an independent set in G} and NC2(G)=min {|N(u)∪N(v)| | d(u, v)=2}. We denote by ω(G) the number of components of agraph G. A graph G is called 1-tough if ω(G\S)≤|S| for every subset S of V(G) withω(G\S)>l. By c(G) we denote the length of the longest cycle in G; in particular, G iscalled a Hamiltonian graph if c(G)=n. H.A. Jung proved that every 1-tough graphwith order n≥11 and σ2≥n-4 is Hamiltonian. We generalize it further as follows: ifG is a 1-tough graph and σ3(G)≥n, then c(G)≥min {n,2NC2(G)+4}. Thus, theconjecture of D. Bauer, G. Fan and H.J. Veldman in [2] is completely solved.     

EXISTENCE OF HAMILTONIAN k-FACTOR

A Hamiltonian k-factor is a k-factor containing a Hamiltonian cycle. An n/2-critical graph G is a simple graph of order n which satisfies S(G) > n/2 and δ(G - e)< n/2 for any edge e ∈ E(G). Let k > 2 be an integer and G be an n/2-critical graph of even order n > 8k-14. It is shown in this paper that for any given Hamiltonian cycle C except that G - C consists of two components of odd orders when fc is odd, G has a k-factor containing C.     

ON THE LEAST EIGENVALUE OF A GRAPH

Let G be a simple graph with n vertices and λ_n(G) be the least eigenvalue of G.In this paper, we show that, if G is connected but not complete, then λ_n(G)≤λ_n(K_(n-1)~1)and the equality holds if and only if G K_(n-1)~1, where K_(n-1)~1, is the graph obtained by thecoalescence of a complete graph K_(n-1) of n-1 vertices with a path P_2 of length one of itsvertices.     

(4m, m)-CHOOSABILITY OF PLANE GRAPHS

1 IntroductionAll graphs considered in tabs paper are abate and sable. Undecked notations and termalnologies can be found in [if.Let G = (V, E,F) be a plase graph, where V, E and F denote the s6t of venices, edgesand faces of G, respectively. We use NG(v) and dG(v) to denote the set and nUmber of venicesadjacent to a vertex yi respectively, and use 6(G) to denote the inininuun degree of G. A vertexv is called a k-vertex if v has degree k. A face of a plane graph is said to be incident w…     

A SIMPLIFIED APPROACH TO EMBEDDING PROBLEMS IN NORMAL BORDISM FRAMEWORK

The purpose of this paper is to simplify the computations of the nor-mal bordism groups Ω_i(W_f,M×P~∞;(?))and Ω_i(C_f,(?)w;θ_f)which Salomonsenand Dax introduced respectively to study the existence and isotopy classificationof differential embeddings of manifolds in manifolds in the metastable range.Asimpler space pair(K_f,M×P~∞)is constructed to replace(W_f,M×P~∞).It isshown that(K_f,M×P~∞)is homotopy equivalent to(W_f,M×P~∞)and homotopy(n-1)-equivalent to(C_f,(?)W).To demonstrate the efficacy of this simplification,the isotopy groups [M~n(?)RP~(n+k)],if n(?)2k-4 and M~n is a closed(n-k+2)-connected manifold,and[M~n(?)L(p;q_1…,q_m)],if 3n(?)4m-2,M~n is a closed(2n-2m+1)-connected manifold and L is a (2m+1)-dimensional lens space,arespecifically computed.     

THE DIRICHLET PROBLEM AND NEUMANN PROBLEM FOR NONLINEAR PARABOLIC SYSTEMS OF SECOND ORDER EQUATIONS WITH MEASURABLE COEFFICIENTS IN A HIGHER DIMENSIONAL DOMAIN

1 Formulation of Dirichlet Problem and Neumann Problem fOrParabolic SystemsLet O be a bounded domain in Rn and the boundary On E C2. Denote Q = g x I,I =0 < t 5 T, 0 < T < ool 0Q = Sl U S2 is the parabolic boundary where S1 = a x {t = 0} is thebottom and S2 = an x I is the lateral boundary. We consider the nonlinear parabolic systemof second order equationsFh(t, xl ut D.u, D:u) -- Hukt = 0 in Q, k = 1, 2,'',m. (l.l)Under certain conditions, system (1.1) can be reduced to the fOrmw…     

QUATERNARY DELSARTE—GOETHALS AND GOETHALS—DELSARTE CODES

1 IlltroductionLet an be the ring of integers modulo 4 and m be the set of n-tuples over wi. A an-linearcode C of length n is a ffe-submodule of m. The type of C is defined to be the type of C asan abelian group. Define the dual code Cl of C byCl = {(x1,x2,'' 5 x.) e wr: x1y1 x2y2 '' xrty. = 0,V(y1,y2,'',y.) 6 C}.The Lee weights of 0, l, 2, 3 E Wi are defined to be 0, 1, 2, l, respectively, and the Lee weightWL(a) of a 6 W is the rational sum of the Lee weights of its cornponent…     

A comparative study of the inventory system with service facility and postponed demands

In this article, we present a continuous review （s,S） inventory system with a service facility consisting of finite buffer （capacity N ） and a single server. The customers arrive according to a Poisson process. The individual customer＇s unit demand is satisfied after a random time of service, which is assumed to be exponential. When the inventory level drops to s＇an order for Q（= S-s） items is placed. The lead time of reorder is assumed to be exponential distribution. An arriving customer, who finds the buffer is full, enters into the pool of infinite size or leaves the system according to a Bernolli trial. At the time of service completion, if the buffer size drops to a preassigned level L （1 〈 L 〈 N） or below and the inventory level is above s, we select the customers from the pool according to two different policy ： in first policy, with probability p （0 〈 p 〈 1） we select the customer from the head of the pool and we place the customer at the end of the buffer; in the second policy, with p （0 〈 p 〈 1） the customer from the pool is transferred to the buffer for immediate service and after completion of his service we provide service to the customer who is in the buffer with probability one. If at a service completion epoch the buffer turns out to be empty, there is at least one customer in the pool and the inventory level is positive, then the one ahead of all waiting in the pool gets transferred to the buffer, and his service starts immediately. The joint probability distribution of the number of customers in the pool, number of customers in the buffer and the inventory level is obtained in the steady-state case. Various stationary system performance measures are computed and total expected cost rate is calculated. A comparative result of two models is illustrate numerically.     

A DEGREE CONDITION FOR THE EXISTENCE OF CONNECTED [k, k 1]-FACTORS

ＡＤＥＧＲＥＥＣＯＮＤＩＴＩＯＮＦＯＲＴＨＥＥＸＩＳＴＥＮＣＥＯＦＣＯＮＮＥＣＴＥＤ［ｋ，ｋ＋１］－ＦＡＣＴＯＲＳＡＤＥＧＲＥＥＣＯＮＤＩＴＩＯＮＦＯＲＴＨＥＥＸＩＳＴＥＮＣＥＯＦＣＯＮＮＥＣＴＥＤ［ｋ，ｋ＋１］－ＦＡＣＴＯＲＳ￥ＣＡＩＭａｏｃｈｅｎ...     

VERTEX-DISJOINT QUADRILATERALS IN BIPARTITE GRAPHS

H. Wang considered the minimum degrees condition that G has large vertex-disjoint cycles in bipartite graphs. Motivated by this, we consider the small vertex-disjoint cycles in bipartite graphs in this paper. We prove the following result: Let m > 3, n > 2 and k >1 be three integers. Let G = (V1,V2;E) be a bipartite graph with | V1| = | V2| =n > 2k 1. If the minimum degreefor any cycle C of G with length 2m, then G contains k vertex-disjoint cycles of length 4. Moreover, the degrees condition is sharp.     

TREE DECOMPOSITIONS OF MULTIGRAPHS

1.IntroductionInthispaperweconsideronlyfiniteundirectedlooplessgraphs.ForasubgraphHofG,E(H)andP(H)denotethenumberofedgesandthenUmberofcyclesinHrespectively.GiventwodisjointsubsetsXandYofV(G),wewriteEG(X,Y)={acEE(G)IxEX,y6Y}.IfTisatreeinGande=acEG--E(T)with{u,v}CV(T),thenT econtainsauniquecycle.WedenotethiscyclebyC(T,e).Aforestiscalledak-tree-forestifitconsistsofexactlykpairwisedisjointtrees.ForagraphG,ifE(G)canbepartitionedilltoseveralpairwisedisjointsetsas{EI,EZ,...,EI}such…     

1/2-TRANSITIVE GRAPHS ASSOCIATED WITH LINEAR GROUPS

１／２－ＴＲＡＮＳＩＴＩＶＥＧＲＡＰＨＳＡＳＳＯＣＩＡＴＥＤＷＩＴＨＬＩＮＥＡＲＧＲＯＵＰＳ￥ＤＵＳｈａｏｆｅｉ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｈａｎｘｉＵｎｉｖｅｒｓｉｔｙ，Ｔａｉｙｕａｎ０３０００６，Ｃｈｉｎａ）Ａｂｓｔｒａｃ...     

某型无人机降落伞回收系统动力学分析

针对我国某型无人机降落伞回收系统,建立了无人机降落伞回收过程中各阶段的动力学模型,分析降落伞-无人机组合体在整个回收过程中的运动特性。并将将计算结果与试验结果中无人机俯仰角的变化进行比较,以验证数值仿真的可靠性。研究结果表明:(1)减速伞开伞动载第一峰值约为1G,第二峰值约为1.3G。主伞开伞动载第一个峰值约为2G;第二个峰值约为2.3G。减速伞和主伞的两个动载峰值相差均不大,说明降落伞设计比较成功;(2)在回收开始后第4秒至第5秒之间,无人机出现了较为强烈的抬头。为了使无人机姿态进一步稳定在期望值,需要在控制律设计中着重解决无人机在回收各个阶段受伞系统影响而产生抬头的问题;(3)当回收高度在2000-10000m之间时,从回收系统在有控和无控状态下的工作包线可知,有控状态时回收系统的正常工作范围比无控状态要广。     

视情维修条件下k/N(G) 系统备件供需联合优化

针对传统m视情维修策略下k/N(G)系统维修决策模型对备件可获取性考虑不足的问题,提出了(m,Q)维修策略及备件订购与生产的联合决策优化方法,建立了两种视情维修条件下k/N(G)系统备件供需联合优化模型。证明了在满足约束条件的同时,(m,Q)维修策略下的联合模型((m,Q, n) 策略模型)具有使目标函数最小的订购阈值m、订货量Q和订货次数n,m维修策略下的联合模型((m,n)策略模型)存在最优订货量m和订货次数n使目标值最小。此外,比较分析了不同模型参数对两种模型决策的影响,结果表明, (m,Q,n)策略模型得到的成本始终小于(m,n) 策略模型,而系统使用可用度始终高于(m,n)策略模型。     

EDGE CONDITION FOR A HAMILTONIAN BIPARTITE GRAPH TO BE BIPANCYCLIC

Let G be a hamiltonian, bipartite graph on 2n vertices, where n>3. It isshown that if e(G)>n(n-1)/2 + 2 then G contains cycles of every possible even length.This improves a result of Entringer and Schmeichel.     

ON A PROPERTY OF SOLUTIONS OF M-MATRIXEQUATIONS

1.IntroductionConsideringthefollowingsystemoflinearequationsAx~b(l.1)whereAisannxnM-matrix,bisanndimensionalvectorandbeRang(A).Theresearchonthesolutionofequation(1.1)isveryimportantinLeontiefmodelofinput-outputanalysis(see[1,2]).G.St..k.ma[Zjstudiestheabo…     

LONG DOMINATING CYCLES IN GRAPHS

1.IntroductionAllgraphsconsideredinthispaperwillbefiniteandsimple.WeuseBondyandMurty[1]forterminologyandnotationsnotdefinedhere.LetG=(V,E)beagraphofordernandCbeacycleinG.Ciscalledadominatingcycle,orbrieflyaD--cycle,ifV(G)\V(C)isanindependentsetinG.ForavertexvinG,theneighborhoodofvisdenotedbyN(v),andthedegreeofvisdenotedbyd(v).FortwosubsetsSandTofV(G),wesetNT(S)~{vET\S:N(v)nS/0}.WewriteN(u,v)insteadofNV(G)({u,v})foranyu,vEV(G).IfFandHaretwosubgraphsofG,wealsowriteNF(H)insteado…     

A NEIGHBORHOOD UNION CONDITION FOR PANCYCLIC GRAPHS

1.IntroductionWeconsideronlysimplefinitegraphs.OurbasicnotationandterminologynotdefinedherefollowthOSeofBondyandMurtyll].ForagraphG,letV(G)andE(G)(orjustVandE)deDOtelievertexsetandedgeset,respectively.Wedenoteapathandacyclecontaining8veniCesbyPaandCarespectively.ThecycleCaiscalledans-cycle.Denotebyg(G)(orbrieflybyg)thegirthofG1.SetNC=min{IN(u)UN(v)l:tv相似文献