Answer the following statements true (T) or false (F)

Question

1) In an undirected graph, an edge of the form (A, B) is the same as an edge of the form (B, A).
2) A complete graph on n vertices has n(n-1)/2 edges.
3) In order to create a topological ordering of vertices in a directed graph, the graph cannot have a cycle.
4) A network is a type of graph in which there is a cost associated with each edge.
5) A graph is a special kind of tree.

Answer 1

1) T
2) T
3) T
4) T
5) F