Subject: Computer Science / Graph Theory / Algorithms
Problem:
I need help solving the following questions for my lab/exam preparation:
Prove that the number of odd degree vertices in any graph is even.
Show that in a complete graph , the number of edges is .
Find the chromatic number of the Petersen graph.
Prove properties of simple connected planar graphs with given vertices and edges.
Write Java programs for Insertion Sort, Merge Sort, Quick Sort, Heap Sort, and N-Queen problem.
What I need:
Step-by-step explanation with proofs and simple Java code suitable for lab exam.

Leave a Reply
You must be logged in to post a comment.