Tag Archives: Graph Minimum Spanning Tree

Given undirected weighted graph G, the task is to find the Maximum Spanning Tree of the Graph using Prim’s Algorithm Prims algorithm is a Greedy… Read More
Prerequisites: Graph Theory Basics, Spanning tree. Complete Weighted Graph: A graph in which an edge connects each pair of graph vertices and each edge has… Read More
Given an undirected weighted complete graph of N vertices. There are exactly M edges having weight 1 and rest all the possible edges have weight… Read More
Given an undirected graph of V nodes (V > 2) named V1, V2, V3, …, Vn. Two nodes Vi and Vj are connected to each… Read More
Give a complete graph with N-vertices. The task is to find out the maximum number of edge-disjoint spanning tree possible. Edge-disjoint Spanning Tree is a… Read More
Consider a weighted complete graph G on the vertex set {v1,v2 ,v} such that the weight of the edge (v,,v) is 2|i-j|. The weight of… Read More
Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum… Read More
Consider the following graph: Which one of the following cannot be the sequence of edges added, in that order, to a minimum spanning tree using… Read More
An undirected graph G has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are 0‘s… Read More
In the graph given in above question question, what is the minimum possible weight of a path P from vertex 1 to vertex 2 in… Read More
Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij in the matrix W below is the weight of the… Read More
The length of the path from v5 to v6 in the MST of previous question with n = 10 is (A) 11 (B) 25 (C)… Read More
An undirected graph G(V, E) contains n ( n > 2 ) nodes named v1 , v2 ,….vn. Two nodes vi , vj are connected… Read More