Answer to Problem 13
These are the graphs for which all connected components are complete graphs.
If no path of length 2 is an induced subgraph of a
graph , then if a
vertex is adjacent to two vertices, then those two
vertices must be adjacent to each other. Thus, all
vertices adjacent to some vertex are adjacent to one
another and are vertices in a complete graph.