GraphTheory[SpecialGraphs] - Maple Programming Help

Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : SpecialGraphs : GraphTheory/SpecialGraphs/ThetaGraph

GraphTheory[SpecialGraphs]

 ThetaGraph
 construct theta graph

 Calling Sequence ThetaGraph(r1, r2, ...)

Parameters

 r1, r2, ... - positive integers

Description

 • 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.

Examples

 > $\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 unweighted graph with 9 vertices and 10 edge\left(s\right)}}$ (1)
 > $\mathrm{DegreeSequence}\left(G\right)$
 $\left[{3}{,}{3}{,}{2}{,}{2}{,}{2}{,}{2}{,}{2}{,}{2}{,}{2}\right]$ (2)
 > $\mathrm{DrawGraph}\left(G\right)$
 > $\mathrm{CircularChromaticNumber}\left(G\right)$
 $\frac{{7}}{{3}}$ (3)