Graphs
Download as PPT, PDF0 likes998 views
The document discusses special types of graph structures including complete graphs, cycles, wheels, and bipartite graphs. It provides examples of how to determine if a graph is bipartite by checking if all its cycles are of even length. The document also mentions subgraphs and spanning subgraphs, defining a subgraph as one whose edges are a subset of the original graph and a spanning subgraph as one that contains all the original vertices.
Graphs
- 2. Special Graph Structures Special cases of undirected graph structures: Complete graphs Kn Cycles Cn Wheels Wn Bipartite graphs
- 3. 01/12/15
- 4. 01/12/15
- 5. 01/12/15
- 6. 01/12/15
- 7. • See Ex. 5, 6, 7, 9, 10, 12. p-601 • Exercise Q. 4, 5, 7, 9, 21-25, 29 p-608
- 9. How to determine that a Graph is Bipartite or not • A graph is bipartite iff all its cycles are of even length. • For every edge, you can connect 2 vertices, and those vertices can be different colors. As long as every edge connects 2 vertices of different color, you have a bipartite. 01/12/15
- 11. 01/12/15
- 12. 01/12/15
- 13. 01/12/15
- 14. 01/12/15
- 15. 01/12/15
- 16. • See Ex. 1,2,3,4,5,6,7. p-612 • Q. 1,3,5,7,11,17,19, 23, 27. p-618 01/12/15
- 17. Exercise: Find the adjacency matrix 01/12/15 a dc b
- 18. 01/12/15
- 19. 01/12/15
- 20. Subgraphs • A subgraph S of a graph G is a graph such that – The edges of S are a subset of the edges of G • A spanning subgraph of G is a subgraph that contains all the vertices of G Subgraph Spanning subgraph Mudasser Naseer 20 01/12/15