A graph with one vertex and no edges is multigraph digraph isolated graph trivia

Question

A graph with one vertex and no edges is

multigraph digraph isolated graph trivial graph       _____________________________________________________________________________________ A graph in which all nodes are of equal degree is called

Multi graph Non regular graph Regular graph Complete graph       _____________________________________________________________________________________ In a graph if e=[u, v], Then u and v are called

Endpoints of e Adjacent nodes Neighbors All of above       _____________________________________________________________________________________ A minimal spanning tree of a graph G is

A spanning sub graph A tree Minimum weights All of above       _____________________________________________________________________________________ How many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric ?

2n(n+1)/2 and 2n.3n(n multigraph digraph isolated graph trivial graph       _____________________________________________________________________________________ Multi graph Non regular graph Regular graph Complete graph       _____________________________________________________________________________________ Endpoints of e Adjacent nodes Neighbors All of above       _____________________________________________________________________________________ A spanning sub graph A tree Minimum weights All of above       _____________________________________________________________________________________ 2n(n+1)/2 and 2n.3n(n A graph with one vertex and no edges is

multigraph digraph isolated graph trivial graph       _____________________________________________________________________________________ A graph in which all nodes are of equal degree is called

Multi graph Non regular graph Regular graph Complete graph       _____________________________________________________________________________________ In a graph if e=[u, v], Then u and v are called

Endpoints of e Adjacent nodes Neighbors All of above       _____________________________________________________________________________________ A minimal spanning tree of a graph G is

A spanning sub graph A tree Minimum weights All of above       _____________________________________________________________________________________ How many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric ?

2n(n+1)/2 and 2n.3n(n Which of the following graphs is isomorphic to

Explanation / Answer

1.A

2.C

3.D

4.A

5.A

6.C

7.D

8.B

9.B

10.B

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.