Difference between revisions of "MCSN Tuesday, 13-Sep-11"
(→Pajek) |
(→Graph theory (Wilson ch. 1)) |
||
| Line 32: | Line 32: | ||
* tree (only one path between each pair of vertices) | * tree (only one path between each pair of vertices) | ||
* planar graph | * planar graph | ||
| − | + | * isomorphic graphs | |
| − | + | * combinatorics: counting graphs | |
| − | + | ** how many simple graphs can you create with 1,2,3,4 vertices? | |
| − | + | * Wilson ch.1 questions | |
| − | |||
= ESNAP reading = | = ESNAP reading = | ||
Revision as of 20:23, 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?
Applications of SNA to music culture
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
- isomorphic graphs
- combinatorics: counting graphs
- how many simple graphs can you create with 1,2,3,4 vertices?
- Wilson ch.1 questions
