NoPerfectMatchingGraph
Combinatorica`
Combinatorica`
NoPerfectMatchingGraph
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
NoPerfectMatchingGraph
returns a connected graph with 16 vertices that contains no perfect matching.
更多信息和选项
- NoPerfectMatchingGraph functionality is now available in the built-in Wolfram Language function GraphData.
- To use NoPerfectMatchingGraph, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
范例
基本范例 (2)
NoPerfectMatchingGraph has been superseded by GraphData:
Wolfram Research (2012)，NoPerfectMatchingGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/NoPerfectMatchingGraph.html.
文本
Wolfram Research (2012)，NoPerfectMatchingGraph，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/NoPerfectMatchingGraph.html.
CMS
Wolfram 语言. 2012. "NoPerfectMatchingGraph." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/NoPerfectMatchingGraph.html.
APA
Wolfram 语言. (2012). NoPerfectMatchingGraph. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/NoPerfectMatchingGraph.html 年