Combinatorica`
Combinatorica`

CompleteQ

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

CompleteQ[g]

yields True if graph g is complete. This means that between any pair of vertices there is an undirected edge or two directed edges going in opposite directions.

Details

Examples

Basic Examples  (2)

CompleteQ has been superseded by CompleteGraphQ:

Wolfram Research (2012), CompleteQ, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/CompleteQ.html.

Text

Wolfram Research (2012), CompleteQ, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/CompleteQ.html.

BibTeX

@misc{reference.wolfram_2021_completeq, author="Wolfram Research", title="{CompleteQ}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/CompleteQ.html}", note=[Accessed: 27-September-2021 ]}

BibLaTeX

@online{reference.wolfram_2021_completeq, organization={Wolfram Research}, title={CompleteQ}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/CompleteQ.html}, note=[Accessed: 27-September-2021 ]}

CMS

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

APA

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