TOPICS
Search

Digraph Union


The digraph union of two digraphs is the digraph whose vertex set (respectively, edge set) is the union of their vertex sets (respectively, edge sets).

Given a positive integer n, the adjacency matrix of the digraph union of two labeled n-digraphs is the entrywise maximum of their adjacency matrices.

If n is a positive integer, then the labeled n-digraphs form a semilattice with respect to the digraph union.


See also

Digraph, Digraph Intersection

This entry contributed by Lorenzo Sauras-Altuzarra

Explore with Wolfram|Alpha

Cite this as:

Sauras-Altuzarra, Lorenzo. "Digraph Union." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/DigraphUnion.html

Subject classifications