# Quelle:Nm2/Brandes Erlebach 2005

## < Quelle:Nm2

31.377Seiten in
diesem Wiki

### Wikia ist eine gebührenfreie Seite, die sich durch Werbung finanziert. Benutzer, die Adblocker einsetzen, haben eine modifizierte Ansicht der Seite. Wikia ist nicht verfügbar, wenn du weitere Modifikationen in dem Adblocker-Programm gemacht hast. Wenn du sie entfernst, dann wird die Seite ohne Probleme geladen.

Angaben zur Quelle [Bearbeiten]

 Autor Ulrik Brandes, Thomas Erlebach Titel Chapter 2 Fundamentals Sammlung Network Analysis: Methodological Foundations Herausgeber Ulrik Brandes, Thomas Erlebach Ort Berlin Heidelberg Verlag Springer Jahr 2005 ISBN 978-3-540-24979-5 ISSN 0302-9743 URL http://www.inf.uni-konstanz.de/algo/publications/be-f-05.pdf Literaturverz. no Fußnoten no Fragmente 1

Fragmente der Quelle:
 Zuletzt bearbeitet: 2014-01-11 23:32:43 WiseWoman

Graphs can be undirected or directed. The adjacency matrix of an undirected graph is symmetric. An undirected edge joining vertices $u, v \in V$ is denoted by $\{u, v\}$.
In directed graphs, each directed edge (arc) has an origin (tail) and a destination (head). An edge with origin $u \in V$ is represented by an ordered pair $(u, v)$. As a shorthand notation, an edge $\{u, v\}$ can also be denoted by $uv$. It should be noted that, in a directed graph, $uv$ is short for $(u, v)$, while in an undirected graph, $uv$ and $vu$ are the same and both stand for $\{u, v\}$. Graphs that can have directed as well undirected edges are called mixed graphs, but such graphs are encountered rarely.
Graphs can be undirected or directed. In undirected graphs, the order of the endvertices of an edge is immaterial. An undirected edge joining vertices $u, v \in V$ is denoted by $\{u, v\}$. In directed graphs, each directed edge (arc) has an origin (tail) and a destination (head). An edge with origin $u \in V$ and destination $v \in V$ is represented by an ordered pair $(u, v)$. As a shorthand notation, an edge $\{u, v\}$ or $(u, v)$ can also be denoted by $uv$. In a directed graph, $uv$ is short for $(u, v)$, while in an undirected graph, $uv$ and $vu$ are the same and both stand for $\{u, v\}$. [...]. Graphs that can have directed edges as well as undirected edges are called mixed graphs, but such graphs are encountered rarely [...]