Premium
Dominating Functions and Graphs
Author(s) -
Diestel Reinhard,
Shelah Saharon,
Steprāns Juris
Publication year - 1994
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/jlms/49.1.16
Subject(s) - combinatorics , mathematics , dominating set , discrete mathematics , graph , vertex (graph theory)
A graph is called dominating if its vertices can be labelled with integers in such a way that for every function ƒ: ω → ω the graph contains a ray whose sequence of labels eventually exceeds ƒ. We obtain a characterization of these graphs by producing a small family of dominating graphs with the property that every dominating graph must contain some member of the family.