On Ramsey numbers: of Path versus wheel-like graphs

-15% su kodu: ENG15
59,95 
Įprasta kaina: 70,53 
-15% su kodu: ENG15
Kupono kodas: ENG15
Akcija baigiasi: 2025-03-03
-15% su kodu: ENG15
59,95 
Įprasta kaina: 70,53 
-15% su kodu: ENG15
Kupono kodas: ENG15
Akcija baigiasi: 2025-03-03
-15% su kodu: ENG15
2025-02-28 70.5300 InStock
Nemokamas pristatymas į paštomatus per 11-15 darbo dienų užsakymams nuo 10,00 

Knygos aprašymas

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.

Informacija

Autorius: Kashif Ali
Leidėjas: LAP LAMBERT Academic Publishing
Išleidimo metai: 2010
Knygos puslapių skaičius: 72
ISBN-10: 3838323963
ISBN-13: 9783838323961
Formatas: 220 x 150 x 5 mm. Knyga minkštu viršeliu
Kalba: Anglų

Pirkėjų atsiliepimai

Parašykite atsiliepimą apie „On Ramsey numbers: of Path versus wheel-like graphs“

Būtina įvertinti prekę

Goodreads reviews for „On Ramsey numbers: of Path versus wheel-like graphs“