首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
A family ( X, B1 ), (X, B2 ), . . . , (X, Bq ) of q STS(v)s is a λ-fold large set of STS(v) and denoted by LSTS λ (v) if every 3-subset of X is contained in exactly λ STS(v)s of the collection. It is indecomposable and denoted by IDLSTS λ (v) if there does not exist an LSTS λ'(v) contained in the collection for any λ' λ. In this paper, we show that for λ = 5, 6, there is an IDLSTS λ (v) for v ≡ 1 or 3 (mod 6) with the exception IDLSTS6 (7).  相似文献   

2.
A hybrid triple system of order v and index λ,denoted by HTS(v,λ),is a pair(X,B) where X is a v-set and B is a collection of cyclic triples and transitive triples on X,such that every ordered pair of X belongs to λ triples of B. An overlarge set of disjoint HTS(v,λ),denoted by OLHTS(v,λ),is a collection {(Y \{y},Ai)}i,such that Y is a(v+1)-set,each(Y \{y},Ai) is an HTS(v,λ) and all Ais form a partition of all cyclic triples and transitive triples on Y.In this paper,we shall discuss the existence problem of OLHTS(v,λ) and give the following conclusion: there exists an OLHTS(v,λ) if and only if λ=1,2,4,v ≡ 0,1(mod 3) and v≥4.  相似文献   

3.
A λ-fold triple system of order v,denoted TS(v,λ),is a pair(V,A)where V is a v-set and A is a collection of 3-subsets(called triples)of V such that each 2-subset of V is contained in exactly λ triples.A triple system is called simple if itcontains no repeated triples. There are two related classes of triple systems,namely,Mendelsohn triple sys-tems and directed triple systems.  相似文献   

4.
A directed triple system of order v,denoted by DTS(v,λ),is a pair(X,B)where X is a v- set and B is a collection of transitive triples on X such that every ordered pair of X belongs toλtriples of B.An overlarge set of disjoint DTS(v,λ),denoted by OLDTS(v,λ),is a collection{(Y\{y},A_i)}_i, such that Y is a(v 1)-set,each(Y\{y},A_i)is a DTS(v,λ)and all A_i's form a partition of all transitive triples of Y.In this paper,we shall discuss the existence problem of OLDTS(v,λ)and give the following conclusion:there exists an OLDTS(v,λ)if and only if eitherλ=1 and v≡0,1(mod 3),orλ=3 and v≠2.  相似文献   

5.
A directed triple system of order v,denoted by DTS(v),is a pair (X,B) where X is a v-set and B is a collection of transitive triples on X such that every ordered pair of X belongs to exactly one triple of B.A DTS(v) (X,A) is called pure and denoted by PDTS(v) if (a,b,c) ∈ A implies (c,b,a) ∈/ A.An overlarge set of PDTS(v),denoted by OLPDTS(v),is a collection {(Y \{yi},Aij) : yi ∈ Y,j ∈ Z3},where Y is a (v+1)-set,each (Y \{yi},Aij) is a PDTS(v) and these Ais form a partition of all transitive triples on Y .In this paper,we shall discuss the existence problem of OLPDTS(v) and give the following conclusion: there exists an OLPDTS(v) if and only if v ≡ 0,1 (mod 3) and v 3.  相似文献   

6.
A λ-fold triple system TS(ν,λ)is an ordered pair(V,B)where V is a setof v elements and B is a collection of 3-subsets(called blocks or triples)of Vsuch that each 2-subset of V is contained in exactly λ triples.A triple system iscalled simple if it contains no repeated triples.  相似文献   

7.
An orthogonal array of strength t,degree k,order v and index λ,denoted by OAλ(t,k,v),is a λvt× k array on a v symbol set such that each λvt× t subarray contains each t-tuple exactly λ times.An OAλ(t,k,v) is called simple and denoted by SOAλ(t,k,v)if it contains no repeated rows.In this paper,it is proved that the necessary conditions for the existence of an SOAλ(3,5,v) with λ≥ 2 are also sufficient with possible exceptions where v = 6 and λ∈ {3,7,11,13,15,17,19,21,23,25,29,33}.  相似文献   

8.
A directed triple system of order v with index λ, briefly by DTS(v,λ), is a pair (X, B) where X is a v-set and B is a collection of transitive triples (blocks) on X such that every ordered pair of X belongs to λ blocks of B. A simple DTS(v, λ) is a DTS(v, λ) without repeated blocks. A simple DTS(v, ),) is called pure and denoted by PDTS(v, λ) if (x, y, z) ∈ B implies (z, y, x), (z, x, y), (y, x, z), (y, z, x), (x, z, y) B. A large set of disjoint PDTS(v, λ), denoted by LPDTS(v, λ), is a collection of 3(v - 2)/λ disjoint pure directed triple systems on X. In this paper, some results about the existence for LPDTS(v, λ) are presented. Especially, we determine the spectrum of LPDTS(v, 2).  相似文献   

9.
An orthogonal array of strength t,degree k,order v and index λ,denoted by OAλ(t,k,v),is a λvt× k array on a v symbol set such that each λvt× t subarray contains each t-tuple exactly λ times.An OAλ(t,k,v) is called simple and denoted by SOAλ(t,k,v)if it contains no repeated rows.In this paper,it is proved that the necessary conditions for the existence of an SOAλ(3,5,v) with λ≥ 2 are also sufficient with possible exceptions where v = 6 and λ∈ {3,7,11,13,15,17,19,21,23,25,29,33}.  相似文献   

10.
An oriented tetrahedron is a set of four vertices and four cyclic triples with the property that any ordered pair of vertices is contained in exactly one of the cyclic triples. A tetrahedral quadruple system of order n (briefly TQS(n)) is a pair (X,B), where X is an nelement set and B is a set of oriented tetrahedra such that every cyclic triple on X is contained in a unique member of B. A TQS(n) (X,B) is pure if there do not exist two oriented tetrahedra with the same vertex set. In this paper, we show that there is a pure TQS(n) if and only if n = 2,4 (mod 6), n > 4, or n = 1,5 (mod 12). One corollary is that there is a simple two-fold quadruple system of order n if and only if n = 2,4 (mod 6) and n > 4, or n = 1,5 (mod 12). Another corollary is that there is an overlarge set of pure Mendelsohn triple systems of order n for n=1,3 (mod 6), n > 3, or n =0,4 (mod 12).  相似文献   

11.
A set W of the vertices of a connected graph G is called a resolving set for G if for every two distinct vertices u, v ∈ V (G) there is a vertex w ∈ W such that d(u, w) ≠ d(v, w). A resolving set of minimum cardinality is called a metric basis for G and the number of vertices in a metric basis is called the metric dimension of G, denoted by dim(G). For a vertex u of G and a subset S of V (G), the distance between u and S is the number min s∈S d(u, s). A k-partition Π = {S 1 , S 2 , . . . , S k } of V (G) is called a resolving partition if for every two distinct vertices u, v ∈ V (G) there is a set S i in Π such that d(u, Si )≠ d(v, Si ). The minimum k for which there is a resolving k-partition of V (G) is called the partition dimension of G, denoted by pd(G). The circulant graph is a graph with vertex set Zn , an additive group of integers modulo n, and two vertices labeled i and j adjacent if and only if i-j (mod n) ∈ C , where CZn has the property that C =-C and 0 ■ C. The circulant graph is denoted by Xn, Δ where Δ = |C|. In this paper, we study the metric dimension of a family of circulant graphs Xn, 3 with connection set C = {1, n/2 , n-1} and prove that dim(Xn, 3 ) is independent of choice of n by showing that dim(Xn, 3 ) ={3 for all n ≡ 0 (mod 4), 4 for all n ≡ 2 (mod 4). We also study the partition dimension of a family of circulant graphs Xn,4 with connection set C = {±1, ±2} and prove that pd(Xn, 4 ) is independent of choice of n and show that pd(X5,4 ) = 5 and pd(Xn,4 ) ={3 for all odd n ≥ 9, 4 for all even n ≥ 6 and n = 7.  相似文献   

12.
A maximum (v, G, λ)-PD and a minimum (v, G, λ)-CD axe studied for 2 graphs of 6 vertices and 7 edges. By means of "difference method" and "holey graph design", we obtain the result: there exists a (v, Gi, λ)-OPD (OCD) for v ≡ 2, 3, 4, 5, 6 (mod 7), λ ≥ 1, i = 1, 2.  相似文献   

13.
A maximum(v,G,λ)-PD and a minimum(v,G,λ)-CD are studied for 2 graphs of 6 vertices and 7 edges.By means of difference method and holey graph design,we obtain the result:there exists a(v,Gi,λ)-OPD(OCD) for v ≡ 2,3,4,5,6(mod 7),λ ≥ 1,i = 1,2.  相似文献   

14.
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].  相似文献   

15.
§ 1  IntroductionA triple system of order v and indexλ,denoted by TS(v,λ) ,is a collection of3- ele-mentsubsets Aof a v- set X,so thatevery 2 - subsetof X appears in preciselyλ subsets of A.L etλ≥ 2 and (X,A) be a TS(v,λ) .If Acan be partitioned into t(≥ 2 ) parts A1,A2 ,...,Atsuch that each (X,Ai) is a TS(v,λi) for 1≤ i≤ t,then (X,A) is called de-composable.Otherwise it is indecomposable.If t=λ,λi=1for 1≤ i≤ t,the TS(v,λ) (X,A) is called completely decomposable.It …  相似文献   

16.
In this paper we study the nonhomogeneous semilinear fractional Schr?dinger equation with critical growth■ where s ∈(0,1),N 4 s,and λ 0 is a parameter,2_s~*=2 N/N-2 s is the fractional critical Sobolev exponent,f and h are some given functions.We show that there exists 0 λ~*+∞such that the problem has exactly two positive solutions if λ∈(0,λ~*),no positive solutions for λλ~*,a unique solution(λ~*,u_(λ~*))if λ=λ~*,which shows that(λ~*,u_(λ~*)) is a turning point in H~s(R~N) for the problem.Our proofs are based on the variational methods and the principle of concentration-compactness.  相似文献   

17.
In this paper,we investigate the intersection numbers of nearly Kirkman triple systems.J_N [v] is the set of all integers k such that there is a pair of NKTS(v)s with a common uncovered collection of 2-subset intersecting in k triples.It has been established that J_N[v]={0,1,...,v(v-2)/6-6,v(v-2)/6-4,v(v-2)/6} for any integers v ≡ 0(mod 6) and v≥66.For v≤60,there are 8 cases left undecided.  相似文献   

18.
A Mendelsohn triple system of order v (MTS(v)) is a pair (X,B) where X is a v-set and 5g is a collection of cyclic triples on X such that every ordered pair of X belongs to exactly one triple of B. An MTS(v) (X,B) is called pure and denoted by PMTS(v) if (x, y, z) ∈ B implies (z, y, x) ∈B. A large set of MTS(v)s (LMTS(v)) is a collection of v - 2 pairwise disjoint MTS(v)s on a v-set. A self-converse large set of PMTS(v)s, denoted by LPMTS* (v), is an LMTS(v) containing [ v-2/2] converse pairs of PMTS(v)s. In this paper, some results about the existence and non-existence for LPMTS* (v) are obtained.  相似文献   

19.
A K1,k-factorization of λKm,n is a set of edge-disjoint K1,k-factors of λKm,n,which partition the set of edges of λKm,n.In this paper,it is proved that a sufficient condition for the existence of K1,k-factorization of λKm,n,whenever k is any positive integer,is that(1) m ≤ kn,(2) n ≤ km,(3) km-n ≡ kn-m ≡ 0(mod(k2-1)) and(4) λ(km-n)(kn-m) ≡ 0(mod k(k -1)(k2 -1)(m n)).  相似文献   

20.
Lei  Li  Xu  Hongwei  Xu  Zhiyuan 《中国科学 数学(英文版)》2020,63(6):1139-1152
In this paper,we firstly verify that if M~n is an n-dimensional complete self-shrinker with polynomial volume growth in R~(n+1),and if the squared norm of the second fundamental form of M satisfies 0≤S-1≤1/18,then S≡1 and M is a round sphere or a cylinder.More generally,let M be a complete λ-hypersurface of codimension one with polynomial volume growth in R~(n+1) with λ≠0.Then we prove that there exists a positive constant γ,such that if |λ|≤γ and the squared norm of the second fundamental form of M satisfies0≤S-β_λ≤1/18,then S≡β_λ,λ 0 and M is a cylinder.Here β_λ=1/2(2+λ~2+|λ|(λ~2+4)~(1/2)).  相似文献   

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

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