ThetaGraph(r1,r2,...) returns the theta graph with the given parameters. Namely it returns a graph consisting of internally disjoint paths of lengths r1, r2, ... between two specified vertices.

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

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

$G≔\mathrm{ThetaGraph}\left(3\,4\,3\right)$

$G≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 9\; vertices\; and\; 10\; edges}$

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

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

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

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

$\frac{7}{3}$