St. Petersburg Mathematical Journal, 18. cilt,511-1027. sayfalarAmerican Mathematical Society, 2007 |
Kitabın içinden
31 sonuçtan 1-3 arası sonuçlar
Sayfa 517
... graph with parameters ( v , k , A ) such that k≥ 3b1 - 3 either has diameter 2 and coincides with the graph P ( 2 ) on 20 vertices or with the graph M ( 19 ) on 19 vertices ; or has at most 2k + 4 vertices ; or has diameter at least 3 ...
... graph with parameters ( v , k , A ) such that k≥ 3b1 - 3 either has diameter 2 and coincides with the graph P ( 2 ) on 20 vertices or with the graph M ( 19 ) on 19 vertices ; or has at most 2k + 4 vertices ; or has diameter at least 3 ...
Sayfa 519
... graph J ( n , 4 ) and 5 is an edge - regular graph of diameter 3 with parameters ( 30 , 12 , 6 ) such that k = 3b1 - 3 and every vertex in [ ( 1432 ) ] forms a good pair with the vertex ( 1234 ) ( if an edge - regular graph with k≥ 3b1 ...
... graph J ( n , 4 ) and 5 is an edge - regular graph of diameter 3 with parameters ( 30 , 12 , 6 ) such that k = 3b1 - 3 and every vertex in [ ( 1432 ) ] forms a good pair with the vertex ( 1234 ) ( if an edge - regular graph with k≥ 3b1 ...
Sayfa 537
... graph with parameters ( v ' , k ' , X ' , μ ' ) and k ' = 2 ' . If = 0 , then k = b1 +1 , and the condition k ≥ 3b1 - 3 implies that b1 ≤ 2 ( if b1 = 1 , the graph I is a hexagon ) . b1 Now , let v ' k , k ' = λ = 2u ' . Then b1 = 2 ...
... graph with parameters ( v ' , k ' , X ' , μ ' ) and k ' = 2 ' . If = 0 , then k = b1 +1 , and the condition k ≥ 3b1 - 3 implies that b1 ≤ 2 ( if b1 = 1 , the graph I is a hexagon ) . b1 Now , let v ' k , k ' = λ = 2u ' . Then b1 = 2 ...
İçindekiler
Asekritova and N Kruglyak Interpolation of Besov spaces in the nondiagonal | 511 |
N Belousov and A A Makhnev On edgeregular graphs with k 3b13 | 517 |
Generalov and N Yu Kosovskaya Hochschild cohomology of the Liu | 539 |
Telif Hakkı | |
27 diğer bölüm gösterilmiyor
Diğer baskılar - Tümünü görüntüle
Sık kullanılan terimler ve kelime öbekleri
adjacent algebra algorithm apply approximation assume assumptions of Theorem b₁ bounded called closed coefficients commutative complex consider constant constructed contains continuous convergence Corollary corresponding cycle defined definition denote depends domain elements entire equal equation equivalent estimate example exists extension fact factorization field finite formal formula function given graph Hence ideal implies inequality integral invariant isomorphic lattice Lemma Math Mathematical matrix means module multiplicity norm Note obtain operator parameters polynomial positive present problem Proof properties Proposition proved reduces refinable regularity relations Remark representation respectively result ring root satisfies scheme sequence solution space statement Subsection subspace suffices Suppose symbol symmetric Theorem theory twisted vector vertex vertices zero