Fusion Operation In Graph
Last Updated :
24 Jan, 2023
What is Fusion operation in Graph Theory?
Let u and v be two distinct vertices in graph G. The fusion of the vertices u and v are treated as a single new vertex 'w' and every edge which was incident on u and v, are now incident on 'w'.
So if a graph has n number of vertices, then the resultant fused graph will have n-1 number of vertices. Let us see some examples of the fuse operation in graph theory.
Examples of Fusion in Graph:
Example 1: Simple Graph
Fusion changing number of both edges and vertices
In the above example of fusion operation, the vertices B and C of graph G are fused into a vertex E in graph G'. Also, note that the number of vertices and edges was reduced from four to three. But although the number of vertices will always be reduced by one in fusion operation, we cannot say the same about edges.
Example 2: Vertices reduced but edges remain same
Fusion without changing number of edges
In the above example, we had 3 edges in graph G and 3 edges in graph G' too after the fusion of vertices B and C into E.
Example 3: Fusion creating self-loop
The task is to apply the fusion operation to the vertices B and C of graph G to fuse them into the vertex W in the resultant graph G' maintaining all the edges as in the original graph G.
Fusion creating a self-loop
As we can see in the above fusion operation, vertices B and C have been fused into vertex W with all the edges that were incident on vertices B and C, now incident upon vertex W.
Example 4: Fusion in graph with self-loop
In this example also, the task is to apply the fusion operation to the vertices B and C of graph G to fuse them into the vertex W in the resultant graph G'.
Fusion in Graph with self-loop
As we can see in the above fusion operation, vertices B and C have been fused into vertex W with all the edges that were incident on vertices B and C, now incident upon vertex W.
Similar Reads
Graph definition & meaning in DSA A Graph is a non-linear data structure consisting of vertices and edges where two vertices are connected by an edge. Example of GraphProperties of a Graph:Vertices (nodes): The points where edges meet in a graph are known as vertices or nodes. A vertex can represent a physical object, concept, or ab
4 min read
Basic Properties of a Graph A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph. The basic properties of a graph include: Vertices (nodes): The points where edges meet in a graph are kn
4 min read
Union and Intersection Operation On Graph In graph theory, the data/objects belong to the same group but each piece of data differs from one other. In this article, we will see union and intersection operations on the graph. Union Operation Let G1(V1, E1) and G2(V2, E2) be two graphs as shown below in the diagram. The union of G1 and G2 is
2 min read
Observations on graph A Graph is a non-linear data structure used for the representation of a set of objects where some pairs of objects are connected. The interconnected objects are represented by points called vertices, and the line that connects the vertices are called edges. Vertices are represented by V and edges ar
4 min read
Implementation of a Hypergraph What is Hypergraph? A hypergraph is a generalization of a graph, where an edge can connect any number of vertices. In a hypergraph, each edge is called a hyperedge and can connect any number of vertices, instead of just two vertices like in a traditional graph. A hypergraph is represented by H(E, V)
5 min read