Dominating Functions and Graphs

DOI10.1112/JLMS/49.1.16zbMATH Open0793.04003OpenAlexW1980122843MaRDI QIDQ4286358FDOQ4286358

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

infinite graphsdominating functionsdominating graphlabelling function

Mathematics Subject Classification ID

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

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
• Publication:4865138
• scientific article; zbMATH DE number 2188424

Cited In (11)

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

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)