IdentifyGraph takes as input an unweighted graph G and attempts to find isomorphisms to one or more named graphs known to GraphTheory.

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

$G≔\mathrm{CycleGraph}\left(5\right)$

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

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

$\left[\left[\mathrm{CycleGraph}\,5\right]\,\left[\mathrm{SpecialGraphs}:-\mathrm{CageGraph}\,2\,5\right]\,\left[\mathrm{SpecialGraphs}:-\mathrm{PaleyGraph}\,5\right]\right]$

$\mathrm{HS}≔\mathrm{SpecialGraphs}:-\mathrm{HoffmanSingletonGraph}\left(\right)$

$\mathrm{HS}≔\mathrm{Graph\; 2:\; an\; undirected\; graph\; with\; 50\; vertices\; and\; 175\; edge(s)}$

$\mathrm{edge}≔{\mathrm{Edges}\left(\mathrm{HS}\right)}_{100}$

$\mathrm{edge}≔\left\{20\,25\right\}$

$G≔\mathrm{DeleteVertex}\left(\mathrm{HS}\,\mathrm{convert}\left(\mathrm{Neighborhood}\left(\mathrm{HS}\,{\mathrm{edge}}_1\right)\,\mathrm{set}\right)\∪\mathrm{convert}\left(\mathrm{Neighborhood}\left(\mathrm{HS}\,{\mathrm{edge}}_2\right)\,\mathrm{set}\right)\right)$

$G≔\mathrm{Graph\; 3:\; an\; undirected\; graph\; with\; 36\; vertices\; and\; 90\; edge(s)}$

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

$\left[\left[\mathrm{SpecialGraphs}:-\mathrm{SylvesterGraph}\right]\right]$

The GraphTheory[IdentifyGraph] command was introduced in Maple 2021.

For more information on Maple 2021 changes, see Updates in Maple 2021.