Term
|
Definition
|
|
Term
|
Definition
| When no edge is repeated in the x-y walk |
|
|
Term
|
Definition
| A closed trail, when x=y and not edge is repeated |
|
|
Term
|
Definition
| Whne no vertex occurs twice of a x-y walk |
|
|
Term
|
Definition
| A closed path, when no vertex is repeated and x=y |
|
|
Term
|
Definition
If there is a path between any two distinct vertices of G. Only one component |
|
|
Term
|
Definition
| the number of components of G |
|
|
Term
|
Definition
| Let V be a finite nonempty set. We say that the pair(V,E) determines a multigraph G with vertex set V and edge set E if, for some x,y E V there are two or more edges in E or the form (x,y) or {x,y} |
|
|
Term
|
Definition
|
|
Term
|
Definition
| If the subgraph contains all edges that are in orginal |
|
|
Term
|
Definition
| Denoted Kn loop freee undirected graph where for all a,b E V a does not equal b there is an edge {a,b} |
|
|
