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


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


open allclose all

Basic Examples  (2)

Test whether a graph is empty:

Non-empty graphs:

Scope  (6)

EmptyGraphQ works with undirected graphs:

Directed graphs:


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:

Introduced in 2010