O GoConqr está de visual novo! Conte para nós o que você achou.

Flashcards

Graphs

Nathanael Jenkins Further Maths A level Inglês 23 flashcards

Flashcards do conjunto (23)

  1. 1GraphA finite set of points connected by lines
  2. 2EdgeJoins one vertex to another, or starts and ends at the same vertex (a loop)
  3. 3SimpleNo loops or multiple edges
  4. 4ConnectedEvery vertex is connected by a single edge or sequence of edges to every other vertex
  5. 5DisconnectedCan be separated into two separate 'pieces'
  6. 6CompleteEvery vertex is connected to every other vertex by one edge
    --
    Denoted K
  7. 7SubgraphPart of a graph which is itself a graph
  8. 8PlanarA graph which can be drawn without any edges crossing over
  9. 9Degree (Vertex)The number of edges which start or finish at a vertex (count loops twice)
  10. 10Handshaking TheoremΣ(degrees of vertices) = 2 (number of edges)
  11. 11DigraphA graph whose edges have a direction
  12. 12BipartiteA graph with two discrete sets of vertices, with no edges connective vertices in the same set
  13. 13Complete BipartiteA bipartite graph in which every vertex in one set is connected to every vertex in the other set by one edge
    --
    Denoted K
  14. 14IsomorphicIdentical graphs which have been drawn in different orientations
  15. 15WalkA sequence of edges and vertices in which the end of one edge is the beginning of the next
  16. 16TrailA walk with no repeated edges (in either direction)
  17. 17PathA walk with no repeated vertices (except that the first may be the last)
  18. 18CycleA closed walk, trail or path
    --
    Finishes at the same vertex where it started
  19. 19Eulerian TrailCrosses every edge of a graph exactly once
    --
    Has no vertices with an odd degree
  20. 20Semi-EulerianHas only two odd vertices; only transversible if you start and finish at the odd vertices
  21. 21Hamiltonian CycleA closed path which passes through every vertex of a graph
  22. 22TreeA connected graph which contains no cycles
  23. 23Spanning TreeA subgraph which includes all vertices of the original graph, and is also a tree

Informações

Descrição
A level Further Maths FlashCards sobre Graphs, criado por Nathanael Jenkins em 04-05-2019.
Visualizações
18
Avaliação

Fale Conosco

Sobre o que é sua mensagem?

O que você acha do novo visual?

Você gostou?