• Anglický jazyk

On Ramsey numbers

Autor: KASHIF ALI

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... Viac o knihe

Na objednávku, dodanie 2-4 týždne

42.84 €

bežná cena: 50.40 €

O knihe

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.

  • Vydavateľstvo: LAP Lambert Acad. Publ.
  • Rok vydania: 2009
  • Formát: Paperback
  • Rozmer: 220 x 150 mm
  • Jazyk: Anglický jazyk
  • ISBN: 9783838323961

Generuje redakčný systém BUXUS CMS spoločnosti ui42.