WOLFRAM

Wolfram 语言与系统参考资料中心

GraphUnion[g1,g2,…]

constructs the union of graphs g_(1), g_(2), and so forth.

GraphUnion[n,g]

constructs n copies of graph g, for any non-negative integer n.

更多信息和选项
Details and Options Details and Options
参见
技术笔记
相关指南
按以下格式引用：
Combinatorica`
Combinatorica`

GraphUnion

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

GraphUnion[g1,g2,…]

constructs the union of graphs g_(1), g_(2), and so forth.

GraphUnion[n,g]

constructs n copies of graph g, for any non-negative integer n.

更多信息和选项

Wolfram Research (2012)，GraphUnion，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/GraphUnion.html.

文本

Wolfram Research (2012)，GraphUnion，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/GraphUnion.html.

CMS

Wolfram 语言. 2012. "GraphUnion." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/GraphUnion.html.

APA

Wolfram 语言. (2012). GraphUnion. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/GraphUnion.html 年

BibTeX

@misc{reference.wolfram_2025_graphunion, author="Wolfram Research", title="{GraphUnion}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/GraphUnion.html}", note=[Accessed: 22-April-2026]}

BibLaTeX

@online{reference.wolfram_2025_graphunion, organization={Wolfram Research}, title={GraphUnion}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/GraphUnion.html}, note=[Accessed: 22-April-2026]}