trivial graph

trivial graph

[′triv·ē·əl ¦graf]
(mathematics)
A graph with one vertex and no edges.
References in periodicals archive ?
Notice that every non trivial graph G contains at least one k-monopoly, with k [member of] [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], since every vertex of G satisfies the k-monopoly condition for the whole vertex set V(G).
The connectivity [kappa] (G) of a connected graph G is the minimum number of vertices whose removal results in a disconnected or trivial graph.
First, it is clear that for a trivial graph one can check in linear time whether it admits a cct.