disjoint union of graphs
combining the vertex and edge sets of two graphs
Press Enter · cited answer in seconds
0 sources
disjoint union of graphs
Summary
disjoint union of graphs is a binary operation[1]. It draws 13 Wikipedia views per month (binary_operation category, ranking #22 of 29).[2]
Key Facts
- disjoint union of graphs's image is recorded as Equivalentie.svg[3].
- disjoint union of graphs's instance of is recorded as binary operation[4].
- disjoint union of graphs's instance of is recorded as graph operation[5].
- disjoint union of graphs's Google Knowledge Graph ID is recorded as /g/11f32hg31f[6].
- disjoint union of graphs's MathWorld ID is recorded as GraphUnion[7].
- disjoint union of graphs's maintained by WikiProject is recorded as WikiProject Mathematics[8].
- disjoint union of graphs's Lexikon der Mathematik entry ID is recorded as 10681[9].
Why It Matters
disjoint union of graphs draws 13 Wikipedia views per month (binary_operation category, ranking #22 of 29).[2]