test if graph is strongly regular
(optional) equation of the form parameters=true or parameters=false
parameters : keyword option of the form parameters=true or parameters=false. This specifies whether the parameters [k, lambda, mu] should be returned when the graph is strongly regular. The default is false.
The IsStronglyRegular(G) command returns true if G is a strongly regular graph and false otherwise.
An undirected graph G is strongly regular if there exist integers k, lambda, and mu such that every vertex has k neighbors and for every pair of vertices (u,v), u and v have exactly lambda neighbors in common if they are themselves adjacent, and exactly mu neighbors in common if they are not.
Note that some parts of this definition may be satisfied trivially, in which a complete graph every pair of vertices is adjacent, so the choice of mu could be arbitrary and therefore mu is undefined.
Any strongly regular graph is regular, but the converse is not true.
G ≔ Graph⁡1,2,2,3,3,1,3,4
G≔Graph 1: an undirected unweighted graph with 4 vertices and 4 edge(s)
P ≔ PetersenGraph⁡
P≔Graph 2: an undirected unweighted graph with 10 vertices and 15 edge(s)
C ≔ ClebschGraph⁡
C≔Graph 3: an undirected unweighted graph with 16 vertices and 40 edge(s)
The GraphTheory[IsStronglyRegular] command was introduced in Maple 2019.
For more information on Maple 2019 changes, see Updates in Maple 2019.
Download Help Document
What kind of issue would you like to report? (Optional)