EmptyGraphQ

EmptyGraphQ[g]

yields True if g is an empty graph and False otherwise.

Details

  • A graph is considered empty if it has no edges.

Examples

open allclose all

Basic Examples  (2)

Test whether a graph is empty:

Non-empty graphs:

Scope  (6)

EmptyGraphQ works with undirected graphs:

Directed graphs:

Multigraphs:

Mixed graphs:

EmptyGraphQ gives False for expressions that are not edgeless graphs:

EmptyGraphQ works with large graphs:

Properties & Relations  (7)

The number of edges of an empty graph is zero:

The vertex degree for an empty graph is all zeros:

The empty graphs are undirected graphs:

The complement of a complete graph is an empty graph:

The intersection of two graphs with different names is an empty graph:

The intersection of any graph and its complement is an empty graph:

The adjacency matrix for an empty graph has all zero entries:

Wolfram Research (2010), EmptyGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/EmptyGraphQ.html.

Text

Wolfram Research (2010), EmptyGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/EmptyGraphQ.html.

CMS

Wolfram Language. 2010. "EmptyGraphQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/EmptyGraphQ.html.

APA

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

BibTeX

@misc{reference.wolfram_2024_emptygraphq, author="Wolfram Research", title="{EmptyGraphQ}", year="2010", howpublished="\url{https://reference.wolfram.com/language/ref/EmptyGraphQ.html}", note=[Accessed: 21-November-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_emptygraphq, organization={Wolfram Research}, title={EmptyGraphQ}, year={2010}, url={https://reference.wolfram.com/language/ref/EmptyGraphQ.html}, note=[Accessed: 21-November-2024 ]}