Doubt in quiz Graphs

#1

How to find topological sort of a graph.

#2

How many simple undirected non-isomorphic graphs are there with 4 vertices? Please explain what is non-isomorphic graph

#3

What is the maximum number of edges in the maximum matching of a bipartite graph with n vertices?

#4

it will be n/2 * n/2 = n*n/4
i.e put n/2 vertex in one set and rest n/2 in other set
and then from each other from one set create an edge to n/2 vertices of other set.

#5

go through this:
https://www.tutorialspoint.com/graph_theory/graph_theory_isomorphism.htm

#6

see this
https://www.geeksforgeeks.org/topological-sorting/#:~:text=Topological%20sorting%20for%20Directed%20Acyclic,4%202%203%201%200”.