Puneet Varma (Editor)

Book (graph theory)

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Book (graph theory)

In graph theory, a book graph (often written B p  ) may be any of several kinds of graph.

One kind, which may be called a quadrilateral book, consists of p quadrilaterals sharing a common edge (known as the "spine" or "base" of the book). That is, it is a Cartesian product of a star and a single edge. The 7-page book graph of this type provides an example of a graph with no harmonious labeling.

A second type, which might be called a triangular book, is the complete tripartite graph K1,1,p. It is a graph consisting of p triangles sharing a common edge. A book of this type is a split graph. This graph has also been called a K e ( 2 , p ) .

Given a graph G , one may write b k ( G ) for the largest book (of the kind being considered) contained within G .

The term "book-graph" has been employed for other uses. Barioli used it to mean a graph composed of a number of arbitrary subgraphs having two vertices in common. (Barioli did not write B p for his book-graph.)

Theorems on books

Denote the Ramsey number of two (triangular) books by r ( B p ,   B q ) .

  • If 1 p q , then r ( B p ,   B q ) = 2 q + 3 (proved by Rousseau and Sheehan).
  • There exists a constant c = o ( 1 ) such that r ( B p ,   B q ) = 2 q + 3 whenever q c p .
  • If p q / 6 + o ( q ) , and q is large, the Ramsey number is given by 2 q + 3 .
  • Let C be a constant, and k = C n . Then every graph on n vertices and m edges contains a (triangular) B k .
  • References

    Book (graph theory) Wikipedia