RozgarDesh (रोजगार देश)

Connected component In this tutorial, We will learn about the connected component in graph theory. Connected component A connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices in the supergraph. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Bi-Connected Components In this tutorial, We will learn about bi-connected Components in the graph theory. Bi-Connected Components A graph is said to be Biconnected if it is connected and even after removing any vertex the graph remains connected. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Strongly Connected Components In this tutorial, We will learn about strongly connected components in graph theory. Strongly Connected Components A graph is said to be strongly connected if every vertex is reachable from every other vertex. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Articulation Points and Bridges In this tutorial, We will learn about articulation points and bridges in graph theory. Articulation Points In a graph, a vertex is called an articulation point if removing it and all the edges associated with it results in the increase in the number of connected components in the graph. Bridges An edge in a graph between vertices u and v is called a bridge if after removing it, there will be no path left between u and v. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Minimum Spanning Tree In this tutorial, We will learn about the minimum spanning tree in graph theory. Minimum Spanning Tree Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Planer Graph In this tutorial, We will learn about the planer graph in graph theory. Planer Graph  A Graph is a planer graph it can be drawn on paper in such a way that no edges cross each other. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Independent Edge or Matching In this tutorial, We learn about matching or independent edge in graph theory. Independent Edge A matching or independent edge set in a graph is a set of edges without common vertices. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Graph Colouring In this tutorial, We will learn about the graph colouring problem in graph theory Vertex Colouring You have given m colours, find a way of colouring the vertices of a graph such that no two adjacent vertices are coloured using the same colour. Chromatic Number The minimum number of colours that needed to color a graph is called its chromatic number. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Vertex Cover In this tutorial, We will learn about the vertex cover in graph theory. Vertex Cover  A vertex cover of an undirected graph is a subset of its vertices such that for every edge (u, v) of the graph, either u or v is in vertex cover i.e minimum number of vertices that covers all edges of the given graph. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Clique in Graph In this tutorial, we will learn about the clique in the graph theory. Clique In graph theory, a clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Independent Set In this tutorial, We will learn about the Independent Set in graph theory. Independent Set An independent set or stable set is a set of vertices in a graph such that there are no two vertices are adjacent i.e there is no edge between vertices of independence set. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Hamiltonian Cycle In this tutorial, We will learn about the Hamiltonian cycle in graph theory. Hamiltonian Cycle Hamiltonian path in the undirected graph is a path that visits each vertex exactly once. In Hamiltonian Cycle there is an additional edge from the first and last vertex of the Hamiltonian path. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Adjacency Matrix In this tutorial, We will learn about the adjacency matrix in graph theory. Adjacency Matrix In graph theory, An adjacency matrix is a square matrix which used to represent a finite graph. The element of the matrix tells the vertex are adjacent or not. If there is an edge from vertex u to v to the element (u,v) of the adjacency matrix is 1 otherwise 0. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Institute of Banking Personnel Selection: IBPS Company Name IBPS Post Name Clerk State India Salary Number of Vacancy 7275 Eligibility Graduation Last Date 10-10-2018 Application Details Job Notification Apply Online Job Application Institute of Banking Personnel Selection: IBPS Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Vijaya Bank Recruitment 2018 Company Name Vijaya Bank Post Name Assistant Manager State India Salary Rs 36200 Number of Vacancy 330 Eligibility Graduation +PG Last Date 27-09-2018 Application Details Job Notification Apply Online Job Application Vijaya Bank Recruitment 2018     Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.