Let be a graph with a vertex labeling that induces an edge labeling defined by . For each , let and A labeling of a graph is said to be friendly if The friendly index set of is defined as
In this paper, we determine the friendly index sets of generalized books.