CirculantGraph[n,l]
constructs a circulant graph on n vertices, meaning the 
vertex is adjacent to the 
and 
vertices, for each 
in list l.
CirculantGraph[n,l]
returns the graph with n vertices in which each 
is adjacent to 
and 
, where l must be an integer.
CirculantGraph
CirculantGraph[n,l]
constructs a circulant graph on n vertices, meaning the 
vertex is adjacent to the 
and 
vertices, for each 
in list l.
CirculantGraph[n,l]
returns the graph with n vertices in which each 
is adjacent to 
and 
, where l must be an integer.
更多信息和选项
- CirculantGraph functionality is now available in the built-in Wolfram Language function CirculantGraph.
- To use CirculantGraph, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
范例
基本范例 (1)
文本
Wolfram Research (2012)，CirculantGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/CirculantGraph.html.
CMS
Wolfram 语言. 2012. "CirculantGraph." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/CirculantGraph.html.
APA
Wolfram 语言. (2012). CirculantGraph. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/CirculantGraph.html 年