St. Petersburg Mathematical Journal, 18. cilt,511-1027. sayfalarAmerican Mathematical Society, 2007 |
Kitabın içinden
19 sonuçtan 1-3 arası sonuçlar
Sayfa 530
... adjacent to y and y ' , a contradiction . Lemma 3.7 . Every vertex d of [ u ] г2 ( y ) is adjacent to a vertex of [ y ] ^ [ z ] . Proof . We assume that a vertex d of [ u ] ПÃ2 ( y ) is adjacent to no vertex of [ y ] n [ z ] . Then each ...
... adjacent to y and y ' , a contradiction . Lemma 3.7 . Every vertex d of [ u ] г2 ( y ) is adjacent to a vertex of [ y ] ^ [ z ] . Proof . We assume that a vertex d of [ u ] ПÃ2 ( y ) is adjacent to no vertex of [ y ] n [ z ] . Then each ...
Sayfa 532
... adjacent to s . Thus , the vertices r and s are adjacent and [ r ] ^ [ s ] = { d , u , t , 92 } . Now , at least one of the vertices r or s ( for definiteness , let it be r ) is not adjacent to f , the degree of t in the graph [ r ] [ y ] ...
... adjacent to s . Thus , the vertices r and s are adjacent and [ r ] ^ [ s ] = { d , u , t , 92 } . Now , at least one of the vertices r or s ( for definiteness , let it be r ) is not adjacent to f , the degree of t in the graph [ r ] [ y ] ...
Sayfa 533
... adjacent to the vertex t outside git Uut . By Lemma 1.1 , the vertex t ' must be adjacent to r or to s , a contradiction . Let e E [ 91 ] [ 92 ] . Since u , 91 , t is an almost good triple and the vertices t and g1 are not adjacent , we ...
... adjacent to the vertex t outside git Uut . By Lemma 1.1 , the vertex t ' must be adjacent to r or to s , a contradiction . Let e E [ 91 ] [ 92 ] . Since u , 91 , t is an almost good triple and the vertices t and g1 are not adjacent , we ...
İç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