networks
gunion
union of two graphs
Calling Sequence
Parameters
Description
Examples
gunion(G, H)
gunion(G, H, 'SIMPLE')
G
-
graph or network
H
'SIMPLE'
(optional) indicates that simple union wanted
Important: The networks package has been deprecated. Use the superseding command GraphTheory[GraphUnion] instead.
This procedure creates a graph whose vertex set is the usual set-theoretic union of the vertex sets of G and H, and which has an edge for each edge of G and for each edge of H.
Multiple edges that have the same endpoints are retained unless 'SIMPLE' is specified, in which case multiple edges are reduced to a single edge.
This routine is normally loaded by using the command with(networks), but it may also be referenced by using the full name networks[gunion](...).
with⁡networks:
G≔complete⁡a1,a2,a3,a4:
H≔complete⁡2,3:
J≔void⁡2,4,a1,a2:
addedge⁡Cycle⁡a1,a2,2,4,J:
U≔gunion⁡G,J:
ends⁡op⁡edges⁡U,U
a1,a2,4,a1,a1,a3,a1,a4,a2,a3,a2,a4,a3,a4,a1,a2,2,a2,2,4
U≔gunion⁡U,H,SIMPLE:
vertices⁡U
1,2,3,4,5,a1,a2,a3,a4
1,3,a1,a3,a1,a4,a2,a3,a2,a4,a3,a4,1,4,1,5,2,3,2,4,2,5,2,a2,4,a1,a1,a2
See Also
GraphTheory
GraphTheory[GraphUnion]
networks(deprecated)[complete]
with
Download Help Document