VroniPlag Wiki

This Wiki is best viewed in Firefox with Adblock plus extension.

MEHR ERFAHREN

VroniPlag Wiki
Registrieren


Typus
KeineWertung
Bearbeiter
Hindemith
Gesichtet
Yes
Untersuchte Arbeit:
Seite: 435, Zeilen: 9-17
Quelle: Brandes Erlebach 2005
Seite(n): 7, 8, Zeilen: 7: 30ff; 8: 1ff
Graphs can be undirected or directed. The adjacency matrix of an undirected graph is symmetric. An undirected edge joining vertices is denoted by .

In directed graphs, each directed edge (arc) has an origin (tail) and a destination (head). An edge with origin is represented by an ordered pair . As a shorthand notation, an edge can also be denoted by . It should be noted that, in a directed graph, is short for , while in an undirected graph, and are the same and both stand for . 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 is denoted by . In directed graphs, each directed edge (arc) has an origin (tail) and a destination (head). An edge with origin and destination is represented by an ordered pair . As a shorthand notation, an edge or can also be denoted by . In a directed graph, is short for , while in an undirected graph, and are the same and both stand for . [...]. Graphs that can have directed edges as well as undirected edges are called mixed graphs, but such graphs are encountered rarely [...]
Anmerkungen

The source is not mentioned anywhere in the paper. But note that the content here are the very basics of graph theory and found at many places (however not always in the same wording). After the title of chapter there is a footnote 2, which reads:

2 Most of the concepts discussed in this section are taken from [22].

(22. West, B.D.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2001))

Sichter
(Hindemith), WiseWoman