Graphs

- Vertices, vertex, nodes: The points of a graph, the graph has 3 vertices, that is vertex a, b
and c
- Degree: The number of edges that are incident to the vertex, fx vertex a has 1 edge which
means it has 1 degree, while b has 2 degrees
o Deg(a) = 1
o deg(b) = 2
o Deg(c) = 3, has three edges
- Edges: The lines of a graph, the graph has 2 edges

- Incident: the edge x, is incident to a and b, as any edge that is connected to vertices.
- Adjacent: b is adjacent to a, c, e. A vertex is adjacent to other vertices, if there are edges
connected to it.
- Isolated: d is isolated. An isolated vertex does not have any edges connected to other
vertices.

- Undirected graph: Order/Direction does not matter in the set.

 List every edge as a set of vertices. Fx edge e = {a,b} which is the same as {b,a}

- Directed graph: Order/direction does matter in the set.

List every edge as a set of ordered pairs. Fx the ordered edge e1 = (a,b), as it has a tail
coming from a and a head going to b. This is not the same as (b,a).

- Tail: Which vertex it starts at

- Head: Which vertex it ends at

- Walk: A walk is a sequence of vertices and edges

- Fx, a -> d walk
o Ae1,be5d
- A closed walk: if I want to walk from e to e, fx ecdfe
- A trivial walk: it does not take any edges
- Trail: A walk without repeated edges
A -> F, adbcf.
This is a trail because we did not use any edges twice

- Closed trail: A circuit, where we don’t take any repeated edges. Meaning a cycle
The walk a->a
Adba
But we can’t do ada, as we take e2 twice.

- Connected graph: It is connected if there Is an x-y path for all x, y elements in the set of
vertices.
o The number of components is denoted as k(G) (the number of connected subgraphs).

- Simple graph: It is loop-free, generally undirected and generally no multiple edges.

- Multiple graph: can have multiple edges with loops.

- Euler path: A Euler path is a path that uses every edge of a graph exactly once.
Euler path starts and ends at different vertices

- Euler circuit: A circuit that uses every edge of a graph exactly once
Euler circuit starts and ends at the same vertex

- Maximal elements are those which are not succeeded by another element.
- Minimal elements are those which are not preceded by another element.
- Greatest element (if it exists) is the element succeeding all other elements.
- Least element is the element that precedes all other elements.

- Hasse diagram
 - Partially ordered set

Consider a relation R on a set S satisfying the following properties:

1. R is reflexive, i.e., xRx for every x ∈ S.

2. R is antisymmetric, i.e., if xRy and yRx, then x = y.
3. R is transitive, i.e., xRy and yRz, then xRz.
4. (symmetric is not mentioned)

Then R is called a partial order relation, and the set S together with partial order is called a partially
order set

- Totally ordered set

A set is totally ordered if it has comparability: For any , either or and the following
properties

The comparability graph of a partially ordered set P has as vertices the elements of P and has as

edges precisely those pairs {x, y} of elements for which

1. R is reflexive, i.e., xRx for every x ∈ S.

2. R is antisymmetric, i.e., if xRy and yRx, then x = y.
3. R is transitive, i.e., xRy and yRz, then xRz.

- Handshake theorem

Sum of degree of all the vertices is twice the number of edges contained in it.
In any graph
 The sum of degree of all the vertices is always even.
 The sum of degree of all the vertices with odd degree is always even.
 The number of vertices with odd degree are always even.

- Strongly connected component

A directed graph is strongly connected, or simply strong, if it contains a directed path from u to v
and a directed path from v to u for every pair of vertices u, v.

- Weakly connected
A directed graph is called weakly connected if replacing all of its directed edges with undirected
edges produces a connected (undirected) graph.
 - Longest simple circuit
The longsest path where you do not repeat vertices.

- Simple circuit
A circuit that does not repeat vertices is called a simple circuit, when it starts and ends at the same
vertex.

- Tree
A graph is called a tree if, and only if, it is circuit-free and connected.
A trivial tree is a graph that consists of a single vertex. A graph is called a forest if, and only if, it is
circuit-free and not connected.
- Rooted tree

- Binary tree
 - Edge-endpoint
A graph G consists of two finite sets: a nonempty set V(G) of vertices and a set E(G) of edges,
where each edge is associated with a set consisting of either one or two vertices called its endpoints.
The correspondence from edges to endpoints is called the edge-endpoint function.