CubeConnectedCycle[d]
returns the graph obtained by replacing each vertex in a d-dimensional hypercube by a cycle of length d. Cube-connected cycles share many properties with hypercubes, but have the additional desirable property that for 
every vertex has degree 3.
CubeConnectedCycle
CubeConnectedCycle[d]
returns the graph obtained by replacing each vertex in a d-dimensional hypercube by a cycle of length d. Cube-connected cycles share many properties with hypercubes, but have the additional desirable property that for 
every vertex has degree 3.
更多信息和选项
- CubeConnectedCycle functionality is now available in the built-in Wolfram Language function GraphData.
- To use CubeConnectedCycle, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
文本
Wolfram Research (2012)，CubeConnectedCycle，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/CubeConnectedCycle.html.
CMS
Wolfram 语言. 2012. "CubeConnectedCycle." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/CubeConnectedCycle.html.
APA
Wolfram 语言. (2012). CubeConnectedCycle. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/CubeConnectedCycle.html 年