Just wondering if somebody can confirm the following:
If I have some number of verticies, if there is only one edge connecting two of the vertices, can this be a bipartite graph, or do all verticies need to be connected to make it a biartite graph?
If I have a graph, lets say 1-2-4-1-3, can this be a tree? My understanding is that it can not be a tree if it contains a cycle, but doesn't a cycle start and finish at the same vertix? I'm thinking it is a tree anyway.
I've been searching for these answers for the last hour. Any help would be very much appreciated.