Please enable JavaScript.
Coggle requires JavaScript to display documents.
Graph Theory and Combinatorics (Pass Marks (Define Isomorphism Between Two…
Graph Theory and Combinatorics
Pass Marks
Define Isomorphism Between Two Graphs and Proove
Find the Shortest Path
Find a Euler Circuit
Define Isomorphic Digraph and Complete Symmetric Digraph
Define Hamiltonian Graph and Hamiltonian Path and Hamiltonian Circuit
Eulerian Graph and Proofs
Discuss the Konigsberg Bridge Problem and Solutions
Prove that the Number of Odd Degree Vertices in a Graph is Always Even
Dual of a Subgraph with Example
Notes on the Fundamental Circuit
Define Spanning Tree with Example
Connected Planar Graph
Show that the Distance Between Vertices of a Connected Graph is a Metric
Discuss the Center of a Tree with Suitable Example
Adjacency Graph & Adjacency Matrix with Example Problems
Algorithm for Finding the Shortest Path from a Specified Vertex to Another Specified Vertex :star:
Algorithm for Finding the Connected Components of a Graph G :star:
Algorithm to Find the Minimum Spanning Tree of a Graph G :star:
Define the Incidence Matrix of a Graph G
Draw Graph from Incidence Matrix
Differentiate Symmetric and Asymmetric Digraphs
State Dirac's Theorem for Hamiltonicity
Flow Chart of Connectedness and Components Algorithm :star:
Dijkstra's Shortest Path Algorithm :star:
Difine Cut-Set Matrix with Example
Kuratowski's Graphs