In graph theory, what is the term for a set of vertices with no edges connecting them?Group of answer choicesComponentPathIsolateDegree

A graph having an edge from each vertex to every other vertex is called a ___________

Edge which connect a vertex to a vertex that is neither its ancestor nor its descendant.a)Forward edgesb)Back edgesc)Cross edgesd)None of the mentioned

A graph can be defined as a collection of:a.Verticesb.Edgesc.Both vertices and edgesd.None of the above

A graph that can be drawn without any edges crossing is called:A. Planar graphB. Bipartite graphC. Connected graphD. Regular graph

Which of the following is true?Group of answer choicesA graph may contain many edges and no verticesA graph may contain no edges and many verticesA graph may contain no edges and no verticesA graph may contain no vertices and many edges