ShuffleExchangeGraph[n]
returns the n-dimensional shuffle-exchange graph whose vertices are length n binary strings with an edge from 
to 
if: (1) 
differs from 
in its last bit; or (2) 
is obtained from 
by a cyclic shift left or a cyclic shift right.
ShuffleExchangeGraph
ShuffleExchangeGraph[n]
returns the n-dimensional shuffle-exchange graph whose vertices are length n binary strings with an edge from 
to 
if: (1) 
differs from 
in its last bit; or (2) 
is obtained from 
by a cyclic shift left or a cyclic shift right.
更多信息和选项
- To use ShuffleExchangeGraph, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
- An option VertexLabel is provided, with default setting False, which can be set to True if the user wants to associate the binary strings to the vertices as labels.
文本
Wolfram Research (2012)，ShuffleExchangeGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/ShuffleExchangeGraph.html.
CMS
Wolfram 语言. 2012. "ShuffleExchangeGraph." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/ShuffleExchangeGraph.html.
APA
Wolfram 语言. (2012). ShuffleExchangeGraph. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/ShuffleExchangeGraph.html 年