28 views

Original Title: Assignment 2

Uploaded by Srikar Chintala

Assignment 2

Attribution Non-Commercial (BY-NC)

- Chess as Graph Theory
- Questions on Markov Chain
- Course Review of Social Network Analysis (coursera)
- Graph Theory for Circuit Analysis
- Report: Expert Search using Internal Corporate Blogs
- adhoc netwrk ppt(1)
- theoritical foundation in computer science
- 2010 - Analyzing Social Media Networks With NodeXL - Figures as Slides 2socisl mediaS
- Luxe Ds Interview Problem Set
- Data Collection VSN
- Bela Bollobas Graph Theory an Introductory Course
- 08-floorplanning
- final[1]
- MELJUN CORTES's - THESES WRITING on "Graph Theory for Image Analysis, An Approach Based on the Shortest Spanning Tree"
- XII Area Under Curves Assignment
- Discrete Syllabus
- Job Shop
- connectLANs
- Data Structure and Algorithms
- Miklos Kresz- Soliton automata with constant external edges

You are on page 1of 4

Assignment 2

CSE V Term (Section B)

CMP 002 Introduction to Graph Theory and its Applications in Computer Science Date of Issue: 08.10.2012 Last date of Submission: 15.11.2012

1. List and explain any four daily life situations where graphs are necessary. 2. Show that the following graphs are not isomorphic.

3. Show that every simple graph on n vertices is isomorphic to a subgraph of Kn. 4. Prove that, in any graph, the number of vertices of odd degree is even. 5. Show that if there is a (u, v)-walk in graph G, then there is also a (u, v)-path in G. 6. Show that a graph is bipartitate if and only if it contains no odd cycle. 7. How many possible paths from source to destination in a travelling sales man problem? 8. Prove that, in a tree, any two vertices are connected by a unique path. 9. What are various practical applications of spanning trees? 10. Write the matrix representation of the following graph

11. Define Hailtonian path of a graph. Give an example of it. 12. Show that a nonempty connected graph is Eulerian if and only if it has no vertex of odd degree, 13. Prove that in a critical graph, no vertex cut is a clique. 14. Calculate the cromatic polynomial of the following graph.

15. Prove that, if a graph is embedded in a plane iff it is embeddable in a sphere. 16. Find the minimum distance from vertex 1 to all vertices according to the algorithm by Dijkstra.

17. What is min-cost-flow problem? Write an approximate algorithm for this. 18. What is geometri dual of a graph? Explain by citing an example. 19. There are a number of ways in which a graph can be stored in a computer memory. Explain each of them. Which one among them is best and why.

20. For the following graph find the minimum spanning tree according to: (a) (b) Prims Algorithm Kruskals Algorithm

21. Write nots on the following: (a) (b) (c) (d) Algorithm of primes Kuratowski graphs Four Color Problem Thickness and crossings of a graph.

22. Draw the graph of the Wheatstones brige circuit. 23. Draw all trees of n labeled for n = 1, 3, and 5. 24. What is the edge connectivity of a complete graph of n vertices? 25. Prove that in any vector space the null vector {0}is orthogonal to every vector in space. 26. Prove that the chromatic number of a graph will not exceed by more than one the maximum degree of the vertices in a graph. 27. Write an algorithm to find the minimum distance between two vertices in a weighted graph. 28. Draw all unlebeled rooted trees of n vertices for n =1, 2, 3,4 and 5. 29. Prove that every connected graph with three or more vertices has at least two vertices which are not cut-vertices. 30. Characterize simple, self dual graphs in terms of their circuit and cut-set matrices. 31. Show that a simple graph with n vertices and more than n2/4 edges can not be a bipatite graph. 32. Observe that there can be no path longer than a hamiltonian path (if it exists) in a graph. 33. Show that a path is its own spanning tree.

34. Show that in a non-separable graph G the set of edges incident on each vertex of G is a cut-set. 35. Express the relationship of dualism between two planar, simple graphs in terms of appropriate matrices. 36. Sketch two different ( i.e. nonisomorphic) graphs that have the same chromatic polynomial. 37. If the region of simple planar graph (with n vertices and e edges) embedded in a plane is bounded by k edges, show that e = k(n-2)/(k-2). 38. Prove that the geometric dual of a self loop free nonseparable planar graph is also nonseparable. 39. Similar to the circuit cut-set matrix, define a spanning tree matrix of a connected graph, and observe some of its properties. 40. Show that for a simple disconneced graph of k components, n vertices, and e edges; the rank of the matrices A, B, and C are n-k, e-n-k, and n-k respectively. 41. Let v be a vertex in a connected graph G. Prove that there exists a spanning tree T in G such that the distance of every vertex from v is the same both in G and in T. 42. Suppose that you are required to make o class schedule in a university. There are a total of n courses to be taught in m available hours in a week. There are pairs of courses that cant be taught at the same time because some students might like to take both. Explain how you will make the schedule. State the condition when it will be impossible to make a compactible schedule. ++++++++++++++++++++

- Chess as Graph TheoryUploaded bymitxael83
- Questions on Markov ChainUploaded byChandrashekhar Choudhari
- Course Review of Social Network Analysis (coursera)Uploaded byjimmyfw
- Graph Theory for Circuit AnalysisUploaded byRahul Tripathy
- Report: Expert Search using Internal Corporate BlogsUploaded byPascal Van Hecke
- theoritical foundation in computer scienceUploaded bySubramanian Manivel
- 2010 - Analyzing Social Media Networks With NodeXL - Figures as Slides 2socisl mediaSUploaded byLeyla Popova Zhuhadar
- Bela Bollobas Graph Theory an Introductory CourseUploaded byVaibhav Daga
- adhoc netwrk ppt(1)Uploaded byShravan Kumar
- Luxe Ds Interview Problem SetUploaded byJose Castillo
- 08-floorplanningUploaded bysunilmpec
- XII Area Under Curves AssignmentUploaded byCRPF School
- Data Collection VSNUploaded bycschronicle
- final[1]Uploaded byGobara Dhan
- Discrete SyllabusUploaded byHamza Chaudhry
- MELJUN CORTES's - THESES WRITING on "Graph Theory for Image Analysis, An Approach Based on the Shortest Spanning Tree"Uploaded byMELJUN CORTES, MBA,MPA
- Job ShopUploaded byJon1002
- connectLANsUploaded byArturoEnriqueCruzHernandez
- Data Structure and AlgorithmsUploaded byShanmugha Priya Balasubramanian
- Miklos Kresz- Soliton automata with constant external edgesUploaded byldkgfd
- Ugc Net Model PaperUploaded bymkumbhcar
- Graph4Scala UserGuideUploaded byDeng Weiting
- 5 x project lesson planUploaded byapi-379780781
- stanUploaded bypirante
- Algo-BUUploaded byTareq Salah
- combinatorics-black-soln.pdfUploaded byscmret
- D. Weaire et al- Pressures in periodic foamsUploaded byFlaoeram
- AN IMPROVED SPFA ALGORITHM FOR SINGLESOURCE SHORTEST PATH PROBLEM USING FORWARD STAR DATA STRUCTUREUploaded byijmit
- random walks notes.pdfUploaded byVrund
- ODD HOLE RECOGNITION IN GRAPHS OF BOUNDED CLIQUE SIZEUploaded bySameer Desai

- Scalable and Secure Sharing of Personal Health Records in Cloud Computing Using Attribute-Based EUploaded bySrikar Chintala
- iBT_Q3_02_readingonlyUploaded byKishor Bhandari
- The Ultimate Guide to Destroy GRE Reading Comprehension by CrunchPrepUploaded byjugoslavija
- List of Universities and Their RequirementsUploaded byKrishna Kaushik Angara
- object oriented software engineeringUploaded bySrikar Chintala
- HCI Assignment 2Uploaded bySrikar Chintala
- PHRUploaded bySrikar Chintala
- Assignment 2Uploaded bySrikar Chintala
- SCSE433_SyllabusUploaded bySrikar Chintala
- Training Ppt DetailsUploaded bySrikar Chintala
- 1.2 AsymptoticNotation2Uploaded bySrikar Chintala
- Lecture 9Uploaded bySrikar Chintala
- repot.docxUploaded bySrikar Chintala
- Synopsis FormatUploaded byKabir Singh
- Ob AssignmentUploaded bySrikar Chintala
- Academic Project Online Shopping Site SynopsisUploaded bySrikar Chintala
- OOSE SyllabusUploaded bySrikar Chintala
- 7.Genalgo ApplicationUploaded bySrikar Chintala
- Graph Theory With ApplicationsUploaded bysumeet0827
- Graph ColoringUploaded bySrikar Chintala
- ch1Uploaded bySrikar Chintala

- weierstrass.pdfUploaded byadityathegreatkarthi
- Ch 5- Continuoty and Differ en Ti AbilityUploaded byAnshuman Singh
- Basics of theory of computationUploaded byLakshyaGhuliani
- Mikhailov Partial Differential EquationsUploaded byAndré
- Rudin 10.20Uploaded byxmattyicex
- Aqa Mfp2 TextbookUploaded bySudibyo Gunawan
- 1.DeterminantUploaded byadimesic
- (2006 Boccaletti Et Al) Complex Networks, Structure and DynamicsUploaded bySergio Mario Chávez
- laparticle.pdfUploaded byHerdinando
- Linear System Theory 2 e SolUploaded byShruti Mahadik
- summer vacation assessmentUploaded bykjkevinjoseph3
- kuadrat2010Uploaded byAndhi Soesilo
- Beta Gamma Functins MaterialUploaded byRitwik Kumar
- Definite Integration TNUploaded byPrashantcool1999
- Metode numerice in C - Titus BeuUploaded byleonardf
- C9BCD713d01Uploaded bySubigya Khadka
- EECE 301 Note Set 33 DT Z TransformUploaded byrodriguesvasco
- Calculus II WorkshetUploaded byZerihun Ibrahim
- M53 Lec4.0 Unit 4 IntroductionUploaded byptrc_
- DifferentiationUploaded byIH Maruf
- IntegralsUploaded bysudersanaviswanathan
- OCR FP2 Revision SheetUploaded byts8166
- Laurent SeriesUploaded byG_Heiss
- Ch1_QuadraticsUploaded byBetty Bavorová
- Calculus RefresherUploaded byVicbeau3
- Sumudu Transform Fundamental PropertiesUploaded byFoued Sa
- Cpp Functions.pdfUploaded bynithish
- Trig NotesUploaded byZhi Wei Chow
- GRADE-11-TYPES-OF-FUNCTIONS.pdfUploaded byJorea Kama
- graphs and trees.pptUploaded bycatarac19