Disjoint union of graphs
id:
disjoint-union-of-graphs-318-3531364
title:
Disjoint union of graphs
text:
In graph theory, a branch of mathematics, the disjoint union of graphs is an operation that combines two or more graphs to form a larger graph.
It is analogous to the disjoint union of sets, and is constructed by making the vertex set of the result be the disjoint union of the vertex sets of the given graphs, and by making the edge set of the result be the disjoint union of the edge sets of the given graphs. Any disjoint union of two or more nonempty graphs is necessarily disconnected.
brand slug:
wiki
category slug:
encyclopedia
description:
Combining the vertex and edge sets of two graphs
original url:
https://en.wikipedia.org/wiki/Disjoint_union_of_graphs
date created:
date modified:
2023-08-18T08:10:58Z
main entity:
{"identifier":"Q48995627","url":"https://www.wikidata.org/entity/Q48995627"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/3/38/Equivalentie.svg","width":360,"height":360}
fields total:
13
integrity:
15