Kód: 06858295
For any two graphs G and H, there exists a least positive integer R(G;H), such that every graph say F of order R(G;H) satisfies the following condition: either F contains G as a subgraph or the complement of F contains H. This boo ... celý popis
Nákupem získáte 129 bodů
For any two graphs G and H, there exists a least positive integer R(G;H), such that every graph say F of order R(G;H) satisfies the following condition: either F contains G as a subgraph or the complement of F contains H. This book studies the determination of Ramsey number for a combination of path P_n and a wheel-like graph. What we mean by wheel-like graph, is a graph obtained from a wheel by a graph operation such as deletion or subdivision of the spoke edges. The classes of wheel-like graphs which we consider are Jahangir graph, generalized Jahangir graph and beaded wheel.
1293 Kč
Osobní odběr Praha, Brno a 12903 dalších
Copyright ©2008-24 nejlevnejsi-knihy.cz Všechna práva vyhrazenaSoukromíCookies
Nákupní košík ( prázdný )
Nacházíte se: