constructs a circulant graph on n vertices, meaning the vertex is adjacent to the and vertices, for each in list l.
returns the graph with n vertices in which each is adjacent to and , where l must be an integer.
- Built-in Graphs
- Graphs & Networks
- Graph Visualization
- Computation on Graphs
- Graph Construction & Representation
- Graphs and Matrices
- Graph Properties & Measurements
- Graph Operations and Modifications
- Statistical Analysis
- Social Network Analysis
- Graph Properties
- Mathematical Data Formats
- Discrete Mathematics