Hi! Would a tutor be able to assist me on this?

 

In a complete graph with 48 vertices, how many vertices will be in each node's adjacency list?

 

 

How many entries will be in the adjacency matrix for a graph with 7 vertices?

 

 

If a directed graph has 10 nodes, what is the largest number of edges it could have?

 

 

Questions:

For Graph A, Is it directed or undirected?

For Graph B, Is it directed or undirected?

 

For Graph A, is there a  path from D to G?

For Graph B, is there a  path from D to G?

 

For Graph A, is there a path from G to D?

For Graph B, is there a path from G to D? 

 

For Graph A, is it weighted?

For Graph B, is it weighted?

 

For Graph A, is it connected?

For Graph B, is it connected?

 

For Graph A, is it complete? 

For Graph B, is it complete?

____________________________________________________________________________________________________________________________________

 

If an undirected graph has 6 nodes, what is the largest number of edges it could have?

 

Consider the following adjacency matrix where, for example, the T on row A indicates an edge going from vertex A to vertex B. The empty cells are to be considered false.

 

 Which of the following statements are true about the graph represented by this adjacency matrix?

Group of answer choices

There is a path from vertex C to vertex D

 

There are two edges leading into vertex B

 

There is no way to get to vertex C from any of the other vertices

 

This is a digraph. This is a digraph. This is a digraph. This is a digraph

 

If this graph were complete, it would contain 25 edges

 

There are three edges leading out of vertex E

 

The graph contains 5 edges

 

There is a path from vertex A to vertex D

 

This is a complete graph. This is a complete graph. This is a complete graph. This is a complete graph

 

 

The questions below refer to the following adjacency-lists representation of a graph:

 

 

How many vertices are in the graph?

 

How many edges are in the graph?

 

Which of the following edges exist in the graph?

Group of answer choices

an edge from 8 to 9

an edge from 1 to 2

an edge from 2 to 1

an edge from 9 to 8

 

Which of the following paths exist in the graph?

a path from 2 to 5

a path from 0 to 7

a path from 9 to 4

a path from 4 to 3
 
 
 
 

Transcribed Image Text:

E Graph A A B H F G C E Graph A A B H F G C