Title of article
Vertex-oblique graphs Original Research Article
Author/Authors
Jens Schreyer، نويسنده , , Hansjoachim Walther، نويسنده , , Leonid S. Mel’nikov، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
7
From page
1538
To page
1544
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 image which are of the same vertex-type. We will show that the set of vertex-oblique graphs of arbitrary connectivity is infinite.
Keywords
Asymmetric graphs , Oblique graphs
Journal title
Discrete Mathematics
Serial Year
2007
Journal title
Discrete Mathematics
Record number
947804
Link To Document