Elementary Graph Theory- Quiz

A graph is made up of

• Only edges

• Only vertices

• Vertices and edges

• Only loops

A graph is called connected if

• It has at least one edge

• Every pair of vertices has a path between them

• It has no edges

• It has at least one cycle

In a complete graph, every pair of vertices is

• Connected by an edge

• Disconnected

• Part of a cycle

• Directed

A directed graph (digraph) is a graph where

• Every edge has a direction

• Every edge has a weight

• Every edge has a cycle

• Every edge is undirected

A planar graph is a graph that

• Has no edges

• Can be drawn without edges crossing

• Has only one vertex

• Is always disconnected

A graph is called Eulerian if

• It has no edges

• It contains a cycle

• It has an Eulerian circuit

• It has only one vertex

A tree is a graph that

• Contains cycles

• Is connected and has no cycles

• Has loops

• Has only one vertex

A tree with n vertices always has

• n edges

• n−1 edges

• 2n edges

• No edges

A spanning tree of a graph is

• A graph with extra edges

• A graph with cycles

• A disconnected graph

• A tree that includes all vertices of the graph

In a tree, there is always

• More edges than vertices

• Exactly one path between any two vertices

• A cycle between every two vertices

• No edges at all