Combinatorica Package >

ButterflyGraph

ButterflyGraph[n]
returns the n-dimensional butterfly graph, a directed graph whose vertices are pairs (w,i), where w is a binary string of length n and i is an integer in the range 0 through n and whose edges go from vertex (w,i) to (w^′,i+1), if w^(′) is identical to w in all bits with the possible exception of the (i+1)^(th) 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 (w,i).
© 2008 Wolfram Research, Inc. japanese.gif
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team