ButterflyGraph[n]
returns the n-dimensional butterfly graph, a directed graph whose vertices are pairs 
, where 
is a binary string of length n and 
is an integer in the range 0 through n and whose edges go from vertex 
to 
, if 
is identical to 
in all bits with the possible exception of the 
bit. Here bits are counted left to right. An option VertexLabel, with default setting False, is allowed. When this option is set to True, vertices are labeled with strings 
.
ButterflyGraph
ButterflyGraph[n]
returns the n-dimensional butterfly graph, a directed graph whose vertices are pairs 
, where 
is a binary string of length n and 
is an integer in the range 0 through n and whose edges go from vertex 
to 
, if 
is identical to 
in all bits with the possible exception of the 
bit. Here bits are counted left to right. An option VertexLabel, with default setting False, is allowed. When this option is set to True, vertices are labeled with strings 
.
Details and Options
- ButterflyGraph functionality is now available in the built-in Wolfram Language function ButterflyGraph.
- To use ButterflyGraph, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Text
Wolfram Research (2012), ButterflyGraph, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/ButterflyGraph.html.
CMS
Wolfram Language. 2012. "ButterflyGraph." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/ButterflyGraph.html.
APA
Wolfram Language. (2012). ButterflyGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/ButterflyGraph.html