DegreeSequence returns a list of the degrees of the vertices of G. For directed graphs, the directions of the edges are ignored.

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$G≔\mathrm{Graph}\left(\mathrm{Trail}\left(1\,2\,3\,4\,2\right)\right)$

$G≔\mathrm{Graph\; 1:\; an\; undirected\; unweighted\; graph\; with\; 4\; vertices\; and\; 4\; edge(s)}$

$\mathrm{DegreeSequence}\left(G\right)$

$\left[1\,3\,2\,2\right]$

$H≔\mathrm{Graph}\left(\mathrm{Trail}\left(1\,2\,3\,4\,2\right)\,\mathrm{directed}\right)$

$H≔\mathrm{Graph\; 2:\; a\; directed\; unweighted\; graph\; with\; 4\; vertices\; and\; 4\; arc(s)}$

$\mathrm{DegreeSequence}\left(H\right)$

$\left[1\,3\,2\,2\right]$

$\mathrm{DrawGraph}\left(G\right)$