| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651087 | Discrete Mathematics | 2007 | 7 Pages |
Abstract
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 V(G)V(G) which are of the same vertex-type. We will show that the set of vertex-oblique graphs of arbitrary connectivity is infinite.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jens Schreyer, Hansjoachim Walther, Leonid S. Mel’nikov,