Vertex-oblique graphs Original Research Article

Let x be a vertex of a simple graph G. The vertex-type of x is the lexicographically ordered degree sequence of its neighbors. We call the graph G vertex-oblique if there are no two vertices in image which are of the same vertex-type. We will show that the set of vertex-oblique graphs of arbitrary connectivity is infinite.