You get a bonus - 1 coin for daily activity. Now you have 1 coin

Union and intersection of graphs

Lecture




A graph union is an operation on graphs that results in a graph whose vertex sets and edges are unions of vertex sets and edges of the original graphs. In other words, the resulting graph includes all edges and vertices that are present in the original graphs [1] .

The operation of combining graphs, as well as a similar operation for sets, is usually denoted by the symbol   Union and intersection of graphs :

  Union and intersection of graphs

So, if

  Union and intersection of graphs

that

  Union and intersection of graphs

Where   Union and intersection of graphs - many vertices,   Union and intersection of graphs - set of edges of the graph.

The intersection of graphs is an operation on graphs, as a result of which a graph is obtained whose vertex sets and edges are intersections of the sets of vertices and edges of the original graphs. In other words, the resulting graph includes only those edges and those vertices that are present in all the original graphs [1] .

The operation of intersection of graphs, as well as a similar operation for sets, is usually denoted by the symbol   Union and intersection of graphs :

  Union and intersection of graphs

So, if

  Union and intersection of graphs

that

  Union and intersection of graphs

Where   Union and intersection of graphs - many vertices,   Union and intersection of graphs - many edges of the graph.

created: 2014-11-02
updated: 2021-01-10
132830



Rating 9 of 10. count vote: 2
Are you satisfied?:



Comments


To leave a comment
If you have any suggestion, idea, thanks or comment, feel free to write. We really value feedback and are glad to hear your opinion.
To reply

Discrete Math. Set theory. Graph theory. Combinatorics.

Terms: Discrete Math. Set theory. Graph theory. Combinatorics.