Dominating Functions and Graphs
From MaRDI portal
Publication:4286358
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
Cited in
(11)- Infinite graphs with finite dominating sets
- scientific article; zbMATH DE number 475607 (Why is no real title available?)
- Domination inequalities and dominating graphs
- Total dominating functions of graphs: antiregularity versus regularity
- Dominating sequences in graphs
- Regularity properties for dominating projective sets
- Dominating Set and Converse Dominating Set of a Directed Graph
- Domination in functigraphs
- scientific article; zbMATH DE number 7394968 (Why is no real title available?)
- Domination games on infinite graphs
- Cardinal characteristics on 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)