Kitabın içinden
33 sonuçtan 1-3 arası sonuçlar
Sayfa 520
Let T be an edge - regular graph , and let u ( u , w ) = k – 261 + 1 and u ( u , z ) = k
– 261 + 2 for some vertices w and z in Tz ( u ) . Then l [ u ] n [ w ] n [ z ] ] < 2 . Proof
. This statement follows from Lemmas 4 and 5 in ( 5 ) . Let w , z E T2 ( u ) .
Let T be an edge - regular graph , and let u ( u , w ) = k – 261 + 1 and u ( u , z ) = k
– 261 + 2 for some vertices w and z in Tz ( u ) . Then l [ u ] n [ w ] n [ z ] ] < 2 . Proof
. This statement follows from Lemmas 4 and 5 in ( 5 ) . Let w , z E T2 ( u ) .
Sayfa 527
vertex x ' of E , one vertex of ( d ) n ( z ] , and two vertices of ( [ d ] n [ u ] ) u ( [ x ] n [
z ] – { y } ) . We have se ] n se ' ] = { d , x , a , a ' , y , z } . If y ( u , a ) < 5 , then [ u ] n (
d ] contains w , two vertices of ( e ] , and two of se ' ] . By Lemma 1 .
vertex x ' of E , one vertex of ( d ) n ( z ] , and two vertices of ( [ d ] n [ u ] ) u ( [ x ] n [
z ] – { y } ) . We have se ] n se ' ] = { d , x , a , a ' , y , z } . If y ( u , a ) < 5 , then [ u ] n (
d ] contains w , two vertices of ( e ] , and two of se ' ] . By Lemma 1 .
Sayfa 536
Now , the subgraph { t , u , y , z , gi , li , hi , di , Wi , ri , i = 1 , . . . , 4 } is a connected
28 - vertex component of the graph T . But this is impossible because , in this
case , for any two adjacent vertices ei , ej , the subgraph ( ei ] n le ; ] coincides
with ...
Now , the subgraph { t , u , y , z , gi , li , hi , di , Wi , ri , i = 1 , . . . , 4 } is a connected
28 - vertex component of the graph T . But this is impossible because , in this
case , for any two adjacent vertices ei , ej , the subgraph ( ei ] n le ; ] coincides
with ...
Kullanıcılar ne diyor? - Eleştiri yazın
Her zamanki yerlerde hiçbir eleştiri bulamadık.
İçindekiler
Asekritova and N Kruglyak Interpolation of Besov spaces in the nondiagonal | 511 |
N Belousov and A A Makhnev On edgeregular graphs with k 361 3 | 517 |
Generalov and N Yu Kosovskaya Hochschild cohomology of the Liu | 539 |
Telif Hakkı | |
16 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 apply approximation assume assumptions of Theorem bounded braid BSu2 called closed coefficients commutative complex consider constant constructed contains continuous convergence Corollary corrector corresponding cycle defined definition denote depends dérivateur diagram categories domain elements equal equation equivalent estimate exact example exists extension fact factorization field finite following result formula function functor given graph Hence homotopy ideal implies inequality integral invariant isomorphism lattice Lemma Math Mathematical matrix means module morphism multiplication natural norm Note object obtain operator pair parameters periodic polynomial positive problem Proof Proposition proved reduces refinable relations Remark respectively ring satisfies scheme sequence similar smooth solution space square statement Subsection subspace suffices Suppose symbol symmetric takes theory twisted values vector vertex vertices zero