Graphs consist of vertices (nodes) and edges connecting them. They can be directed or undirected, weighted or unweighted. Common representations include Adjacency Matrices and Adjacency Lists. Algorithms like BFS and DFS are used for traversal.