Some Basic Definitions of Graph Theory (1)

1. Definitions Definition of a graph A graph G is a pair (V,E) where V=V(G) is a set of vertices and E=E(G) is a multiset of edges, where an edge is a set of at most two vertices.

The order of G and the size of G is respectively. Definition of a vertex and an edge Vertex u and v are adjacent (or neighbours) in G if uv is in E(G) A vertex v and an edge e are incident if v is in E(G) Two edges e, e' are incident if the intersection of e and e' is not an empty set u, v are endpoints of the edge uv ...