9/3/19 DCS/CSCI 2350: Social & Economic Networks Graphs Reading: Ch 2 (Easley-Kleinberg) Mohammad T . Irfan Email: mirfan@bowdoin.edu Graphs "Graph theory is a terminological jungle, in which any newcomer may plant a tree." – John Barnes 1
9/3/19 https://griffsgraphs.wordpress.com/2012/07/02/a- facebook-network/ 2
9/3/19 LinkedIn InMaps https://blog.linkedin.com/2011/01/24/linkedin-inmaps 3
9/3/19 Political blogs (2004) 4
9/3/19 Graphs Some Properties Puzzles: Degree-sum formula Max # of edges Konigsberg bridge problem Konigsberg Bridge Problem 5
9/3/19 Graphs Paths Cycles ARPANET (1970) 6
9/3/19 Graphs Connectivity Components High school relationships (1993-95) 7
9/3/19 Review of vocabulary Network ßà Graph Node ßà Vertex Edge: undirected vs. directed (arc) Degree of a node Endpoints of an edge Directed, undirected, mixed graphs Simple vs non-simple graph Subgraph Degree-sum formula Maximum number of edges Eulerian circuit problem Path Cycle Connected vs. disconnected graph Connected components of a graph High school relationships (1993-95) Reading u Chapter 2 of Easley-Kleinberg u Due before the next class 8
Recommend
More recommend