lectures.alex.balgavy.eu

Lecture notes from university.
git clone git://git.alex.balgavy.eu/lectures.alex.balgavy.eu.git
Log | Files | Refs | Submodules

index.md (1163B)

      1 +++
      2 title = 'Types of graphs'
      3 +++
      4 # Types of graphs
      5 ## Symmetricity
      6 
      7 | **Undirected (symmetric)** | **Directed/digraph (asymmetric)** | **Mixed** |
      8 | --- | --- | --- |
      9 | ![screenshot.png](5599e893bd5d381f3346ebe72a7070cb.png) | ![screenshot.png](46f1af0e00eb8d6d76b8a68fa5789360.png) | ![screenshot.png](1d51452f58935b1fa6c2b9c02f2c2a14.png) |
     10 
     11 ## Weighted graph
     12 
     13 ![](f9222403d65bcae110253413dc91d4d6.png)![](73f28abacce4a7c95766a5908690328e.png)
     14 
     15 ## Simplicity
     16 
     17 | **Simple** | **Multigraph** |
     18 | --- | --- |
     19 | Undirected, unweighted graph that has no loops and no more than one edge between any two different vertices<br>![screenshot.png](aecb0a5cf2b4d7b44991d715d6f8fe77.png) | Multiple edges connecting the same two vertices within a simple graph<br>![screenshot.png](955ccf90835ef4f55efc5af6d3a0cdc1.png) |
     20 
     21 ## Connectedness
     22 
     23 A graph may also have a connected component
     24 
     25 | **Connected** | **Disconnected** |
     26 | --- | --- |
     27 | If there is for any two given vertices a path between them<br>![screenshot.png](01e7a5b2f0ddddef838882b31e14bb0c.png) | If not all pairs of vertices have a path between them<br>![screenshot.png](c39fbee31a32652e49b69479cccda233.png) |