Let \( G = (V, E) \) be a graph with a vertex labeling \( f: V \to \mathbb{Z}_2 \) that induces an edge labeling \( f^*: E \to \mathbb{Z}_2 \) defined by \( f^*(xy) = f(x) + f(y) \). For each \( i \in \mathbb{Z}_2 \), let

\[
v_f(i) = \text{card}\{v \in V: f(v) = i\}
\]

and

\[
e_f(i) = \text{card}\{e \in E: f^*(e) = i\}.
\]

A labeling \( f \) of a graph \( G \) is said to be friendly if

\[
\lvert v_f(0) – v_f(1) \rvert \leq 1.
\]

The friendly index set of \( G \) is defined as

\[
\{\lvert e_f(1) – e_f(0) \rvert : \text{the vertex labeling } f \text{ is friendly}\}.
\]

In this paper, we determine the friendly index sets of generalized books.

Given 2 triangles in a plane over a field \( F \) which are in perspective from a vertex \( V \), the resulting Desargues line or axis \( l \) may or may not be on \( V \). To avoid degenerate cases, we assume that the union of the vertices of the 2 triangles is a set of six points with no three collinear. Our work then provides a detailed analysis of situations when \( V \) is on \( l \) for any \( F \), finite or infinite.

We give constructive and combinatorial proofs to decide why certain families of slightly irregular graphs have no planar representation and why certain families have such planar representations. Several non-existence results for infinite families as well as for specific graphs are given. For example, the nonexistence of the graphs with \( n = 11 \) and degree sequence \( (5, 5, 5, \ldots, 4) \) and \( n = 13 \) and degree sequence \( (6, 5, 5, \ldots, 5) \) are shown.

Let \( G \) be a graph with vertex set \( V(G) \) and edge set \( E(G) \). Let \( A = \{0, 1\} \). A labeling \( f: V(G) \to A \) induces a partial edge labeling \( f^*: E(G) \to A \) defined by

\[
f^*(xy) = f(x) \quad \text{if and only if } f(x) = f(y),
\]

for each edge \( xy \in E(G) \). For \( i \in A \), let

\[
v_f(i) = \text{card}\{v \in V(G) : f(v) = i\}
\]

and

\[
e_{f^*}(i) = \text{card}\{e \in E(G) : f^*(e) = i\}.
\]

A labeling \( f \) of a graph \( G \) is said to be friendly if

\[
\lvert v_f(0) – v_f(1) \rvert \leq 1.
\]

If

\[
\lvert e_{f^*}(0) – e_{f^*}(1) \rvert \leq 1,
\]

then \( G \) is said to be \textbf{balanced}. The balancedness of the Cartesian product and composition of graphs is studied in [19]. We provide some new families of balanced graphs using other constructions.