A VIEW ON UNION OF SOME GRAPHS IN GRAPH THEORY

Abstract

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. Eulerian to the Swiss mathematician Leonhard Euler, who invents graph theory in the 18th century. The disjoint union of two sets and is binary operator that combines all distinct element of a pair of given sets, while retaining the original set membership as a distinguishing characteristic of the union set.