Book (graph theory)

Not to be confused with book embedding.

File:Graph book sample.gif

A triangular book

In graph theory, a book graph (often written $B_p$ ) may be any of several kinds of graph formed by multiple cycles sharing an edge.

Variations

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 K_1,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)$ or a thagomizer graph (after thagomizers, the spiked tails of stegosaurian dinosaurs, because of their pointy appearance in certain drawings) and their graphic matroids have been called thagomizer matroids. Triangular books form one of the key building blocks of line perfect graphs. 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.)

Within larger graphs

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

Theorems on books

Denote the Ramsey number of two triangular books by $$\begin{gathered} r(B_p, \\ {B}_q). \end{gathered}$$ This is the smallest number $r$ such that for every $r$-vertex graph, either the graph itself contains $B_p$ as a subgraph, or its complement graph contains $B_q$ as a subgraph.

• If $1\le p\le q$, then $$\begin{gathered} r(B_p, \\ {B}_q)=2q+3 \end{gathered}$$.
• There exists a constant $c=o(1)$ such that $$\begin{gathered} r(B_p, \\ {B}_q)=2q+3 \end{gathered}$$ whenever $q\ge cp$.
• If $p\le q/6+o(q)$, and $q$ is large, the Ramsey number is given by $2q+3$.
• Let $C$ be a constant, and $k=Cn$. Then every graph on $n$ vertices and $m$ edges contains a (triangular) $B_k$.