Criado por Chloe Anderson
quase 8 anos atrás
|
||
Questão | Responda |
Tree | a connected graph with no cycles |
Spanning Tree (sub-graph) | a sub-graph which includes all the nodes and edges of another graph |
Graph | consists of points (nodes) which are connected by lines (edges) |
Weighted Graph | a graph which has a number associated with each edge |
Node (vertices) | point on a graph |
Edge | a line on a graph which connects two nodes |
Degree/Valency/Order | number of edges connected to 1 node |
Path | a sequence of edges such that the end vertex of one edge is the beginning of another (NO VERTEX APPEARS MORE THEN ONCE) |
Walk | a path which you are permitted to return to more than once |
Cycle | a closed path |
Digraph | a graph where the edges have a direction (eg 5km) |
Isomorphic | where, in multiple graphs, the nodes and edges are connected identically but the shape is different |
Bipartite | a graph with 2 sets of vertices and the connections are between the two sets not within |
Complete Graph | when every node is connected by two edges |
Even degree | for example- 2 edges connected to 1 node---- 2=even |
Loop | similar to a cycle - starts and ends at the same node |
Sub-graph | vertices and edge are subsets of another graph |
Simple Graph | contains no loops or multiple edges |
Quer criar seus próprios Flashcards gratuitos com GoConqr? Saiba mais.