Quiz
Graph Theory
Erstelle ein kostenloses Konto, um dieses Quiz zu beenden
Speichere deinen Fortschritt und sieh dir dein Endergebnis an.
oder mit deiner E-Mail registrieren
Schon ein Konto? Anmelden
Fragen in diesem Quiz (10)
1"All cycle' s are paths, but not all paths are cycles"
- ATrue
- BFalse
2Adjacency Matrix = A(i,j) where i and j are vertex's. Incidence Matrix = A(i,j) where ... ?
- Ai is a vertex and j is an edge
- Bj is a vertex and i is an edge
- Ci and j are edge's
3Two graphs are isomorphic is there is a _________________________ berween them.
- AInjection
- BSubjection
- CBijection
4A spanning subgraph is a graph..
- Awhich contains every vertex of G
- Bwhich has the same edges as G
- Cwhich has at least two vertices with a degree of 3
5A tree is a connected cyclic graph
- ARichtig
- BFalsch
6A Eulerian walk contains
- Aequal number of odd and even vertices
- Ball odd degree vertices
- Ceither 0 or exactly 2 vertices of odd degree
7A hamilton path is a path which
- Awhich connects back to the starting node
- Bwhich connects every node in graph G to the rest
- Ctraverses every edge in graph G exactly once
- Dtraverses every node in graph G exactly once
8A geodesic is the shortest path to a given node on a Graph G
- ARichtig
- BFalsch
9A Graph can have more than one Sink
- ARichtig
- BFalsch
10Which of the following is a hamilton path?
- A

- B

- C

- D

- A
Informationen
- Beschreibung
- Beginner Mathematics Quiz am Graph Theory, erstellt von Lezwon Castellino am 29/02/2016.
- Autor
- Lezwon Castellino
- Sprache
- English
- Aufrufe
- 2
- Schlagwörter
- Bewertung
- Noch keine Bewertungen Bewerte dieses Quiz