Bounds on domination parameters in graphs: a brief survey
From MaRDI portal
Publication:2151205
DOI10.7151/dmgt.2454zbMath1492.05116OpenAlexW4293193129MaRDI QIDQ2151205
Publication date: 1 July 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2454
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Transversals and domination in uniform hypergraphs
- Restrained domination in cubic graphs
- Graphs with large paired-domination number
- Independence in 5-uniform hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- Total restrained domination in graphs with minimum degree two
- A characterization of cubic graphs with paired-domination number three-fifths their order
- Two relations between the parameters of independence and irredundance
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Spanning trees in graphs of minimum degree 4 or 5
- Graphs with large restrained domination number
- Restrained domination in graphs
- On independent domination number of regular graphs
- An upper bound for the independent domination number
- On the independent domination number of graphs with given minimum degree
- On a conjecture involving a bound for the total restrained domination number of a graph
- Essential upper bounds on the total domination number
- Transversal numbers of uniform hypergraphs
- On the independent domination number of regular graphs
- Independent domination in graphs: A survey and recent results
- Bounds on the semipaired domination number of graphs with minimum degree at least two
- On the domination number of graphs with minimum degree six
- A new upper bound on the total domination number in graphs with minimum degree six
- Bounds on the paired domination number of graphs with minimum degree at least three
- New probabilistic upper bounds on the domination number of a graph
- Independent sets in regular graphs
- Graphs with large semipaired domination number
- A new bound on the domination number of connected cubic graphs
- On equality in an upper bound for the restrained and total domination numbers of a graph
- Domination in graphs of minimum degree five
- On domination in connected cubic graphs
- Domination number of graphs with minimum degree five
- A note on the upper bound for the paired-domination number of a graph with minimum degree at least two
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Spanning Trees with Many Leaves
- Domination in graphs with minimum degree two
- DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR
- Hypergraphs with large transversal number and with edge sizes at least 3
- Total domination in graphs
- Domination-balanced graphs
- Some remarks on domination
- Connected Domination and Spanning Trees with Many Leaves
- Graphs with large total domination number
- Paired-domination in graphs
- A note on improved upper bounds on the transversal number of hypergraphs
- Paths, Stars and the Number Three
- Total Domination in Graphs
- Domination in Graphs: Core Concepts
- Structures of Domination in Graphs
- Topics in Domination in Graphs
- A Transition from Total Domination in Graphs to Transversals in Hypergraphs
