Question Type 2: Creating adjacency tables for weighted and unweighted graphs Exercises

From the adjacency table below for an undirected graph, compute the degree of each vertex:

Given the undirected unweighted graph with vertex set $V=\\{A,B,C,D,E\\}$ and edge set $E=\\{AB,AC,BD,CE,DE\\}$, construct its adjacency table.

Using the adjacency table below for an undirected graph, determine if the graph is connected:

The undirected weighted graph has vertices $1,2,3,4$ and weighted edges: $1–2(5)$, $1–3(2)$, $2–4(7)$, $3–4(4)$. Create its adjacency table.

The adjacency table of an undirected graph is:

How many connected components does this graph have?

Given the adjacency table below for an undirected graph, list all edges and sketch the graph:

Given the unweighted adjacency table for an undirected graph:

Decide if the graph has an Eulerian circuit.

Construct the adjacency table for the directed weighted graph with vertices $A,B,C$ and arc weights: $A\to B(3)$, $A\to C(6)$, $B\to C(1)$, $C\to A(4)$.

The weighted adjacency table of an undirected graph is:

Reconstruct the graph and label each edge with its weight.

Convert the undirected adjacency list below into its adjacency matrix ordering vertices as $A,B,C,D$:

For the directed graph given by the adjacency table:

Compute the in-degree and out-degree of each vertex.

The adjacency table below defines an undirected graph. Determine whether it is bipartite.