共查询到20条相似文献,搜索用时 62 毫秒
1.
The Ramsey size number of dipaths 总被引:1,自引:0,他引:1
David Reimer 《Discrete Mathematics》2002,257(1):173-175
2.
3.
4.
Yutaka Hiramine 《Discrete Mathematics》2008,308(15):3257-3264
In this paper we show that if a square transversal design TDλ[k;u], say D(=(P,B)), admits a class semiregular automorphism group G of order s, then we have a by matrix M with entries from G∪{0} satisfying , where , if i=j, and , otherwise. As an application of (*), we show that any symmetric TD2[12;6] admits no nontrivial elation. We also obtain a result that gives us a restriction on the existence of elations of putative projective planes of composite order. 相似文献
5.
6.
7.
8.
9.
10.
Special Transverse Slices and Their Enveloping Algebras 总被引:1,自引:0,他引:1
Alexander Premet 《Advances in Mathematics》2002,170(1):1-55
11.
12.
B. Zlatanov 《数学物理学报(B辑英文版)》2011,31(2):576-590
In this note, we investigate the generalized modulus of convexity δ ( λ ) and the generalized modulus smoothness ρ ( λ ) . We obtain some estimates of these moduli for X = lp . We obtain inequalities between WCS coefficient of a K¨othe sequence space X and δ ( λ ) X . We show that, for a wide class of K¨othe sequence spaces X, if for some ε∈ (0, 9 10 ] holds δ X (ε) > 1 3 1 √ 3 2 ε, then X has normal structure. 相似文献
13.
14.
15.
16.
17.
Mirko Lepovi? 《Discrete Mathematics》2007,307(6):730-738
Let G be a simple graph of order n. Let and , where a and b are two nonzero integers and m is a positive integer such that m is not a perfect square. We say that Ac=[cij] is the conjugate adjacency matrix of the graph G if cij=c for any two adjacent vertices i and j, for any two nonadjacent vertices i and j, and cij=0 if i=j. Let PG(λ)=|λI-A| and denote the characteristic polynomial and the conjugate characteristic polynomial of G, respectively. In this work we show that if then , where denotes the complement of G. In particular, we prove that if and only if PG(λ)=PH(λ) and . Further, let Pc(G) be the collection of conjugate characteristic polynomials of vertex-deleted subgraphs Gi=G?i(i=1,2,…,n). If Pc(G)=Pc(H) we prove that , provided that the order of G is greater than 2. 相似文献
18.
19.