GeeksforGeeks

Which of the following two is a better Graph traversal algorithm for path finding between two nodes X and Y in a given Graph
1) BFS
2) DFS

How to find all possible cycles in a graph?

Write a Complete program check whether Graph is Connected or Not & also for whether Graph is Tree or not.

Prove that in a graph, sum of degrees = twice the number of edges.

given that, also deduce a relation between number of vertices and number of edges.

Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices?
(A) No two vertices have the same degree.
(B) At least two vertices have the same degree.
(C) At least three vertices have the same degree.
(D) All vertices have the same degree.

Why does the following link use 3 colors for BFS of graph. Same algo is given in Cormen book also.
http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/breadthSearch.htm

The program could be implemented only with 2 (marked or not). In fact the algo given on Wiki page (http://en.wikipedia.org/wiki/Breadth-first_search#Pseudocode) uses only on 1 bit.

How many 32K x 1 RAM chips are needed to provide a memory capacity of 256Kbytes?
(A) 8
(B) 32
(C) 64
(D) 128

What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cycle? Assume n >= 2.
(A) 2
(B) 3
(C) n-1
(D) n

Given a graph (V,E)

A "independent set" of vertices as a set of vertices, of graph , which are not mutually adjucent(I mean take any two vertices from the set, thos shud not be adjucent)

A "maximal independent set" as a independent set , which is not a subset of any other independent set of the graph.

Problem is how to find out all possible maximal independent sets of the given graph,

I think it is a standard problem in graph theory, but I have no idea about it. if...

In a complete undirected graph (of n vertices and ofcourse n*(n-1)/2 edges), each edge is either blue or black in colour (given in adjacency matrix representation). Are there three distinct vertices say A, B, C such that AB, BC and CA are of same colour. (Answer should be either "YES" or "NO").

Don't forget to give time and space complexity.

Giving a Grid in 2D array like this where each cell has a cost from 1-9

9 8 8 4 2
3 6 8 9 9
2 4 9 3 7
1 6 2 9 1
6 9 7 9 9

Find the least cost among source 1,1 and destination 4,4.

Any algorithm for this?

More if maximum numbers of moves are given, then find the least cost path using these moves.

A simple algorithm to find out all cycles in a graph and also to determine whether they are odd or even.

* odd cycle - no of vertices in the cycle is odd
* even cycle-no of vertices in the cycle is even

Write a program to find eccentricity of a graph node

how to find the second minimum spanning tree in a given graph?

write an algorithm to separate biconnected components of an undirected graph

How many vertices are required to obtain 1024 unique undirected graphs

How to detect cycle in a directed graph?