Question

A graph with no edges is called as empty graph. Empty graph also known as -

• A. Trivial graphs
• B. Regular graphs
• C. Bipartite graphs
• D. None of these

Answer 1

The correct option is A Trivial graphs

A graph with no edges is called as empty graph. Empty graph is also known as trivial graphs.

An empty graph on nodes consists of isolated nodes with no edges. Such graphs are also called edgeless graphs or null graphs.

A graph with only one vertex is called a trivial graph.

A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related". The objects correspond to mathematical abstractions called and each of the related pairs of vertices is called an edge.