Computer Science, asked by yatendrasingh2000, 1 month ago

combining all the edges is known as​

Answers

Answered by shagunjoshi181
0

Answer:

In graph theory, an edge contraction is an operation that removes an edge from a graph while simultaneously merging the two vertices that it previously joined. Edge contraction is a fundamental operation in the theory of graph minors. Vertex identification is a less restrictive form of this operation

Answered by Anonymous
0

It is known as a graph.

  • It represents a collection of points or vertices that are joined by a network of lines known as edges.  They are one of the connections joining the key points or distinct vertices.
  • Within a multigraph, many edges which are generally more than two are typically connected to the same dual vertices.
  • As the entry of the multigraph's incidence matrix, multiple degree edges between the vertex and vertex correspond to an integer.
Similar questions