The content here is same as the wikipedia entry at this link. I am just writing this as i can't seem to concentrate by just reading.
Complete graph - all possible pairs of vertices are adjacent or the degree of all vertices is |V|-1.
k-regular graph - every node in a graph with n nodes has the same degree k<= n-1.
Line graph - the line graph of G, denoted as L(G), is the graph where the edges of G correspond to the nodes of L(G), and two edges in L(G) are adjacent if they share a node in G.
The adjacency matrix - The adjacency matrix A(X) of a directed graph X is the integer matrix with roes and columns indexed by the vertices of X, such that the uv-entry if A(X) is equal to the number arcs FROM u TO v.
The spectrum of graph X is the set of eigen values of A(X) along with their multiplicities.
Cycles are of two types.
1. Closed walk - sequence of vertices starting and ending at the same vertex. Its implied that the vertices are adjacent to each other.
2. Simple cycle - closed walk with no repetition of vertices or edges allowed, other than the starting vertex.
Tree - is an undirected graph in which any two vertices are connected by a simple path.
Spanning tree - The spanning tree of a connected undirected graph G is a tree that includes all the vertices and some or all of the edges of G.
Vector spaces defined on a graph - vertex space, edge space, cycle space, cut space.
Complete graph - all possible pairs of vertices are adjacent or the degree of all vertices is |V|-1.
k-regular graph - every node in a graph with n nodes has the same degree k<= n-1.
Line graph - the line graph of G, denoted as L(G), is the graph where the edges of G correspond to the nodes of L(G), and two edges in L(G) are adjacent if they share a node in G.
The adjacency matrix - The adjacency matrix A(X) of a directed graph X is the integer matrix with roes and columns indexed by the vertices of X, such that the uv-entry if A(X) is equal to the number arcs FROM u TO v.
The spectrum of graph X is the set of eigen values of A(X) along with their multiplicities.
Cycles are of two types.
1. Closed walk - sequence of vertices starting and ending at the same vertex. Its implied that the vertices are adjacent to each other.
2. Simple cycle - closed walk with no repetition of vertices or edges allowed, other than the starting vertex.
Tree - is an undirected graph in which any two vertices are connected by a simple path.
Spanning tree - The spanning tree of a connected undirected graph G is a tree that includes all the vertices and some or all of the edges of G.
Vector spaces defined on a graph - vertex space, edge space, cycle space, cut space.