VertexQ
Examples
open all close allScope (5)
VertexQ works with undirected graphs:
VertexQ works with large graphs:
Compare performance with a test based on VertexList:
Applications (3)
Properties & Relations (3)
VertexQ[g,v] is equivalent to MemberQ[VertexList[g],v]:
The performance of VertexQ is typically higher:
Use VertexIndex to find the position of a vertex in VertexList[g]:
VertexIndex is typically faster than Position:
Use EdgeQ to test whether an edge is part of a graph:
See Also
Related Guides
History
Text
Wolfram Research (2010), VertexQ, Wolfram Language function, https://reference.wolfram.com/language/ref/VertexQ.html.
CMS
Wolfram Language. 2010. "VertexQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/VertexQ.html.
APA
Wolfram Language. (2010). VertexQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/VertexQ.html
BibTeX
@misc{reference.wolfram_2025_vertexq, author="Wolfram Research", title="{VertexQ}", year="2010", howpublished="\url{https://reference.wolfram.com/language/ref/VertexQ.html}", note=[Accessed: 13-August-2025]}
BibLaTeX
@online{reference.wolfram_2025_vertexq, organization={Wolfram Research}, title={VertexQ}, year={2010}, url={https://reference.wolfram.com/language/ref/VertexQ.html}, note=[Accessed: 13-August-2025]}