The general graphic concept of discrete mathematics: discrete mathematics is a mathematical discipline that studies the structure and relationship of discrete quantities and is an important branch of modern mathematics. The meaning of discreteness refers to different connecting elements. The structure based on discreteness and the relationship between them are mainly studied, and its objects are generally finite or countable elements. Trivial graph belongs to the category of discrete mathematics and graph theory.

The definition of trivial graph:

A graph with 1 and only one node is called a trivial graph.

2. An ordinary graph is an ordinary tree.

3. A graph with an empty edge set is called a zero graph, and a zero graph with order 1 is called a trivial graph. The so-called n-order graph refers to a graph with n vertices.

4. A graph with an empty vertex set is called an empty graph.