Difference between revisions of "MCSN Tuesday, 13-Sep-11"
(→Graph theory (Wilson ch. 1)) |
|||
Line 28: | Line 28: | ||
* tree (only one path between each pair of vertices) | * tree (only one path between each pair of vertices) | ||
* planar graph | * planar graph | ||
− | * | + | * counting graphs |
− | * | + | ** isomorphic graphs, and difference |
− | ** how many simple graphs can you create with 1,2,3,4 | + | ** how many different simple graphs can you create with a fixed number of vertices? (1,2,3,4) |
* Wilson ch.1 questions | * Wilson ch.1 questions | ||
Revision as of 20:27, 12 September 2011
Contents
Today's assignment
Social structure. Read Preface, p. 1, and sections 1.1 to 1.3.2. Graph theory exercise due (distributed by email) - submit answers via the Moodle (see above for instructions regarding network diagrams). Brainstorm some MCSN examples with research questions.
Course mechanics
Pajek
- installations ok?
- Issues with Wine?
- Got data?
Graph theory (Wilson ch. 1)
- vertex
- edge,arc
- degree
- graph, digraph
- multiple edges, loops
- simple graph
- walk, path
- Eulerian (edge) and Hamiltonian (vertex) graphs
- connected and disconnected graphs
- tree (only one path between each pair of vertices)
- planar graph
- counting graphs
- isomorphic graphs, and difference
- how many different simple graphs can you create with a fixed number of vertices? (1,2,3,4)
- Wilson ch.1 questions
ESNAP reading
- Sections 1.1 to 1.3.2.