Graph Theory : trees and hamiltonian path
Q1:   Number of different rooted labeled vertices trees with n nodes
a)2^(n-1)

b) 2^n

c)n^(n-1)

d)n^n


Q2: the length of a Hamiltonian path in a connected graph of n vertices is

a)n-1

b)n

c)n+1

d) n/2

Q3: What is the number of Minimum Spanning Trees that cab be created from a graph 
 with no self loops/ with self loops/ a multigraph

and pls give any logic/theorem behind it.
Graph Theory : trees and hamiltonian path
===

Q1:   Number of different rooted labeled vertices trees with n nodes
a)2^(n-1)

b) 2^n

c)n^(n-1)

d)n^n


Q2: the length of a Hamiltonian path in a connected graph of n vertices is

a)n-1

b)n

c)n+1

d) n/2

Q3: What is the number of Minimum Spanning Trees that cab be created from a graph 
 with no self loops/ with self loops/ a multigraph

and pls give any logic/theorem behind it.