PPT Slide
Simple Graph
A simple graph
A Non-Simple Graph
A Multigraph
Multiple Edges
Another Non-Simple Graph
A Pseudograph
Loops
Undirected Graphs
A Directed Graph
A Directed Multigraph
Types of Graphs
Adjacent Vertices (Neighbors)
Degree of a vertex
Handshaking Theorem
Subgraph
C5 is a subgraph of K5
Union
W5 is the union of S5 and C5
Homework
Adjacency Matrix
Finding the adjacency matrix
Path of Length n
One path from a to e
One path from a to a
Theorem 1
Paths of Length r between Vertices
ACKNOWLEDGMENT:
Email: ssorkin@ccbc.cc.md.us
Home Page: http://student.ccbc.cc.md.us/~ssorkin/index.html
Download presentation source