Combinatorica`
Combinatorica`

VertexConnectivity

バージョン10で，Combinatorica パッケージの機能のほとんどがWolframシステムに組み込まれた． »

VertexConnectivity[g]

グラフ から削除したらグラフが連結されなくなるような，最小の頂点数を返す．

VertexConnectivity[g,Cut]

削除したらグラフが連結されなくなるような，最小の頂点集合を返す．

詳細とオプション

例題

例  (2)

この関数の代りに Mathematica カーネルのVertexConnectivityが使われるようになった：

Wolfram Research (2012), VertexConnectivity, Wolfram言語関数， https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html.

テキスト

Wolfram Research (2012), VertexConnectivity, Wolfram言語関数， https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html.

CMS

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

APA

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

BibTeX

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

BibLaTeX

@online{reference.wolfram_2024_vertexconnectivity, organization={Wolfram Research}, title={VertexConnectivity}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/VertexConnectivity.html}, note=[Accessed: 18-November-2024 ]}