A graph is made of a set with Nodes(Vertices) and another set with Edges which connects Nodes.

when nodes U and V are connected with an edge E, nodes U and V are Adjacent and E is Incident to U and V

An edge with only one incident node.

when there's more than one edge between two nodes.

Edges are represented as arrows with directions.

Edges contain weights

number of incident edges to node v.

For directed graphs:

out degree: edges going outwards a node.

in degree: edges coming towards a node.

includes only partial nodes and partial edges

all nodes but only partial edges

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic

A graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other

for all n nodes in a graph, each node should have n - 1 edges

a graph whose vertices can be divided into two disjoint and independent sets and such that every edge connects a vertex in to one in