search
Log In
2 votes
516 views

Specify an adjacency-lists representation of the undirected graph given above.

in Graph Theory
edited by
516 views

1 Answer

8 votes
 
Best answer

An adjacency list is an array $A$ of separate lists.

Each element of the array $A_{i}$ is a list, which contains all the vertices that are adjacent to vertex $i$.

$A_{1}\rightarrow2\rightarrow3\rightarrow5$

$A_{2}\rightarrow1\rightarrow3$

$A_{3}\rightarrow1\rightarrow2\rightarrow4\rightarrow5$

$A_{4}\rightarrow3\rightarrow5$

$A_{5}\rightarrow1\rightarrow3\rightarrow4$


selected by

Related questions

8 votes
2 answers
1
489 views
Show that the number of odd-degree vertices in a finite graph is even.
asked Nov 15, 2016 in Graph Theory makhdoom ghaya 489 views
12 votes
3 answers
2
5.7k views
The number of edges in a regular graph of degree $d$ and $n$ vertices is ____________
asked Oct 4, 2014 in Graph Theory Kathleen 5.7k views
0 votes
2 answers
3
421 views
State whether the following statements are TRUE or FALSE: Every infinite cyclic group is isomorphic to the infinite cyclic group of intergers under addition.
asked Nov 9, 2016 in Graph Theory makhdoom ghaya 421 views
1 vote
1 answer
4
404 views
State whether the following statement is TRUE or FALSE: There is a linear-time algorithm for testing the planarity of finite graphs.
asked Nov 9, 2016 in Graph Theory makhdoom ghaya 404 views
...