SmallestCyclicGroupGraph
自己同型群が巡回群であるような,最小の自明でないグラフを返す.
SmallestCyclicGroupGraph
SmallestCyclicGroupGraph
自己同型群が巡回群であるような,最小の自明でないグラフを返す.
詳細とオプション
- SmallestCyclicGroupGraphの機能はWolfram言語の組込み関数GraphDataで利用できるようになった.
- SmallestCyclicGroupGraphを使うためには,まず Combinatorica パッケージをロードしなくてはならない.それにはNeeds["Combinatorica`"]を実行する必要がある.
テクニカルノート
テキスト
Wolfram Research (2012), SmallestCyclicGroupGraph, Wolfram言語関数, https://reference.wolfram.com/language/Combinatorica/ref/SmallestCyclicGroupGraph.html.
CMS
Wolfram Language. 2012. "SmallestCyclicGroupGraph." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/SmallestCyclicGroupGraph.html.
APA
Wolfram Language. (2012). SmallestCyclicGroupGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/SmallestCyclicGroupGraph.html
BibTeX
@misc{reference.wolfram_2025_smallestcyclicgroupgraph, author="Wolfram Research", title="{SmallestCyclicGroupGraph}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/SmallestCyclicGroupGraph.html}", note=[Accessed: 13-April-2026]}
BibLaTeX
@online{reference.wolfram_2025_smallestcyclicgroupgraph, organization={Wolfram Research}, title={SmallestCyclicGroupGraph}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/SmallestCyclicGroupGraph.html}, note=[Accessed: 13-April-2026]}