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.
CompleteQ
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 and Options
- CompleteQ functionality is now available in the built-in Wolfram Language function CompleteGraphQ .
- To use CompleteQ, you first need to load the Combinatorica Package using Needs ["Combinatorica`"].
Examples
Basic Examples (2)
CompleteQ has been superseded by CompleteGraphQ :
See Also
Tech Notes
Related Guides
-
▪
- Graph Properties ▪
- Graphs & Networks ▪
- Graph Visualization ▪
- Computation on Graphs ▪
- Graph Construction & Representation ▪
- Graphs and Matrices ▪
- Graph Properties & Measurements ▪
- Graph Operations and Modifications ▪
- Statistical Analysis ▪
- Social Network Analysis ▪
- Graph Properties ▪
- Mathematical Data Formats ▪
- Discrete Mathematics
Text
Wolfram Research (2012), CompleteQ, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/CompleteQ.html.
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
BibTeX
@misc{reference.wolfram_2025_completeq, author="Wolfram Research", title="{CompleteQ}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/CompleteQ.html}", note=[Accessed: 05-December-2025]}
BibLaTeX
@online{reference.wolfram_2025_completeq, organization={Wolfram Research}, title={CompleteQ}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/CompleteQ.html}, note=[Accessed: 05-December-2025]}