Combinatorica`
Combinatorica`

ShuffleExchangeGraph

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

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.

Details and Options

  • 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 Language function, https://reference.wolfram.com/language/Combinatorica/ref/ShuffleExchangeGraph.html.

Text

Wolfram Research (2012), ShuffleExchangeGraph, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/ShuffleExchangeGraph.html.

CMS

Wolfram Language. 2012. "ShuffleExchangeGraph." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/ShuffleExchangeGraph.html.

APA

Wolfram Language. (2012). ShuffleExchangeGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/ShuffleExchangeGraph.html

BibTeX

@misc{reference.wolfram_2023_shuffleexchangegraph, author="Wolfram Research", title="{ShuffleExchangeGraph}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/ShuffleExchangeGraph.html}", note=[Accessed: 19-March-2024 ]}

BibLaTeX

@online{reference.wolfram_2023_shuffleexchangegraph, organization={Wolfram Research}, title={ShuffleExchangeGraph}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/ShuffleExchangeGraph.html}, note=[Accessed: 19-March-2024 ]}