In mathematics a graph invariant or graph property is one of the basic properties of graphs studied in graph theory. Mathematics, often abbreviated maths in Commonwealth English and math in American English, is the study of abstraction. ...
In mathematics and computer science, graph theory studies the properties of graphs. ...
A graph can be given graphically in the form of a graph drawing. But a given graph may be drawn in several equivalent ways and even for small graphs it is often hard to decide if two drawings represent the same graph, that is if two graphs are isomorphic. Graphs are often represented pictorially as follows: draw a dot for every vertex, and for every edge draw an arc connecting its endpoints. ...
In the mathematical field of graph theory a graph homomorphism is a mapping between two graphs that respects their structure. ...
When manipulating graphs in a computer, depending on the data structure used, the vertices and the edges of the graph have to be labeled. There is no canonical way to label a graph and a common problem is to decide if two graph structures are isomorphic. In computer science, a graph is an abstract data type (ADT) that consists of a set of nodes and a set of edges that establish relationships (connections) between the nodes. ...
This article just presents the basic definitions. ...
This article just presents the basic definitions. ...
In the mathematical discipline of graph theory, a graph labeling is the assignment of unique identifiers to the edges and vertices of a graph. ...
Proving that two given graph presentations are not isomorphic is often done by showing that one graph has a certain graph invariant the other graph lacks.
Graph invariants
 number of vertices
 number of edges
