On the page-number of a circulant graph

Abstract

Listen

Translate article

The page-number of a graph G, denoted by p(G), is the minimum k such that G has an embedding in a k-book. The circulant graph C(m, n) is such a graph that its vertex set is { v 0 , v 1 , … , v m − 1 } and edge set is { v i v i + 1 , v i v i + n | i = 0 , 1 , … , m − 1 } , where m, n are positive integers satisfying 2 ≤ n ≤ ⌊ m 2 ⌋ and indices is read modulo m. In the paper we show that the page-number of a circulant graph C(m, n) is three except for C ( 2 k , 2 ) , where the page-number of C ( 2 k , 2 ) is two.