Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Function Repository Resource:
Test if a graph is periodic
![]() | Periodic |
![]() | Not periodic |
Test whether a undirected graph is periodic:
In[1]:= | ![]() |
Out[1]= | ![]() |
PeriodicGraphQ works with undirected graphs:
In[2]:= | ![]() |
Out[2]= | ![]() |
Weighted graphs:
In[3]:= | ![]() |
Out[3]= | ![]() |
Multigraphs:
In[4]:= | ![]() |
Out[4]= | ![]() |
The Foster 42A graph is periodic:
In[5]:= | ![]() |
Out[5]= | ![]() |
In[6]:= | ![]() |
Out[6]= | ![]() |
Wolfram Language 13.0 (December 2021) or above
This work is licensed under a Creative Commons Attribution 4.0 International License