On some classes of bivalent and trivalent planar graphs

Jorge Alencar, Jean-Guy Caputo, Leonardo de Lima +1

A graph is called bivalent or trivalent if there exists an eigenvector of the graph Laplacian composed from {-1,1} or {-1,0,1}, respectively. These bivalent and trivalent eigenvect…