Dominating Functions and Graphs

DOI10.1112/JLMS/49.1.16MaRDI QIDQ4286358zbMATH OpenOpenAlexFDO

Authors Reinhard Diestel, S. Shelah, Juris Steprāns

Publication date 30 August 1994

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9308215

zbMATH Keywords

dominating functionsdominating graphinfinite graphslabelling function

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: A graph is called dominating if its vertices can be labelled with integers in such a way that for every function f: omega-> omega the graph contains a ray whose sequence of labels eventually exceeds f. 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.

Recommendations

• scientific article; zbMATH DE number 475607
• Dominating functions and total dominating functions of countable graphs
• Infinite graphs with finite dominating sets
• scientific article; zbMATH DE number 844153
• scientific article; zbMATH DE number 2188424

Cited in

(11)

• Domination games on infinite graphs
• Regularity properties for dominating projective sets
• Cardinal characteristics on graphs
• scientific article; zbMATH DE number 475607 (Why is no real title available?)
• Domination in functigraphs
• scientific article; zbMATH DE number 7394968 (Why is no real title available?)
• Infinite graphs with finite dominating sets
• Dominating Set and Converse Dominating Set of a Directed Graph
• Total dominating functions of graphs: antiregularity versus regularity
• Domination inequalities and dominating graphs
• Dominating sequences in graphs

This page was built for publication: Dominating Functions and Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286358)