Dually vertex-oblique graphs (Q878622)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5146829
Language Label Description Also known as
default for all languages
No label defined
    English
    Dually vertex-oblique graphs
    scientific article; zbMATH DE number 5146829

      Statements

      Dually vertex-oblique graphs (English)
      0 references
      0 references
      26 April 2007
      0 references
      Let \(G\) be a simple graph on \(n\) vertices. A vertex \(v\) of degree \(dv\) with neighbours of degrees \(x_1\geq x_2\geq\cdots\geq x_{dv}\) has vertex type \(t(v):= (x_1,x_2,\dots, x_{dv})\). \(G\) is vertex-oblique if each vertex has a distinct vertex type. This paper gives a construction of dually center-oblique graphs (the set of vertex types of \(G\) is the same as that of \(\overline G\)).
      0 references
      vertex-oblique graph
      0 references
      dually vertex-oblique graph
      0 references
      semivertex-oblique graph
      0 references
      supervertex-oblique graph
      0 references
      vertex-type sequence
      0 references
      0 references

      Identifiers