CSE 2321 Final Graph Theory

poo

number of edges incident with the vertex

degree of any vertex of an undirected graph is

closed

origins and terminus of a walk are the same, the walk is

n-1

maximum degree of any vertex in a simple graph with n vertices

the complete graph with 4 vertices has k edges where k is

6

number of edges present in complete graph Kn having n vertices

n(n-1)/2

what is the max num of edges in a bipartite graph having 12 vertices

36

what is the max num of possible non-zero values in an adjacency matrix of a simple graph with n vertices

n(n-1)

the number of elements in the adjacency matrix of a graph having 7 vertices

49

number of edges incident with the vertex V

degree of a vertex