graphs
TRANSCRIPT
![Page 1: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/1.jpg)
Discrete Structures Graphs
![Page 2: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/2.jpg)
Special Graph Structures
Special cases of undirected graph structures:Complete graphs Kn
Cycles Cn
Wheels Wn
Bipartite graphs
![Page 3: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/3.jpg)
04/15/23
![Page 4: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/4.jpg)
04/15/23
![Page 5: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/5.jpg)
04/15/23
![Page 6: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/6.jpg)
04/15/23
![Page 7: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/7.jpg)
• See Ex. 5, 6, 7, 9, 10, 12. p-601• Exercise Q. 4, 5, 7, 9, 21-25, 29 p-608
![Page 8: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/8.jpg)
04/15/23
a
f
e d
c
b
g
![Page 9: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/9.jpg)
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.
04/15/23
![Page 10: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/10.jpg)
04/15/2304/15/23
a
f
e d
c
b
![Page 11: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/11.jpg)
04/15/23
![Page 12: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/12.jpg)
04/15/23
![Page 13: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/13.jpg)
04/15/23
![Page 14: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/14.jpg)
04/15/23
![Page 15: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/15.jpg)
04/15/23
![Page 16: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/16.jpg)
• See Ex. 1,2,3,4,5,6,7. p-612 • Q. 1,3,5,7,11,17,19, 23, 27. p-61804/15/23
![Page 17: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/17.jpg)
Exercise: Find the adjacency matrix
04/15/23
a
dc
b
![Page 18: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/18.jpg)
04/15/23
![Page 19: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/19.jpg)
04/15/23
![Page 20: Graphs](https://reader036.vdocuments.us/reader036/viewer/2022062406/55c3af04bb61eb1d678b4849/html5/thumbnails/20.jpg)
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 subgraphMudasser Naseer 20 04/15/23