$1.$ Does the adjacency matrix represent a simple graph?

Yes

No

unanswered

$2.$ Can the adjacency matrix potentially represent an undirected graph?

Yes

No

unanswered

$3.$ Is the graph connected?

Yes

No

unanswered

$4.$ What is the minimum such that contains no entry equal to $?$ If such an does not exist, then enter $.$

unanswered

$5.$ How many connected components does the graph have?

unanswered

$6.$ What is the maximum degree of a node in the graph?

unanswered

$7.$ How many walks of length $5$ are there from node $0($represented by first row$/$column$)$ to itself?

unanswered

$8.$ Is the following statement True or False? $$For an undirected graph, that is not weighted or a multigraph, the diagonal entries of are equal to the degree of the nodes."

True

False

unanswered