Best possible upper bounds on the restrained domination number of cubic graphs
From MaRDI portal
Publication:6565811
DOI10.1002/jgt.23095zbMATH Open1542.05134MaRDI QIDQ6565811
Michael A. Henning, Boštjan Brešar
Publication date: 2 July 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Cites Work
- Cubic graphs with large ratio of independent domination number to domination number
- Domination versus independent domination in cubic graphs
- Restrained domination in cubic graphs
- A characterization of cubic graphs with paired-domination number three-fifths their order
- On domination in 2-connected cubic graphs
- Graphs with large restrained domination number
- Restrained domination in graphs
- Total domination versus domination in cubic graphs
- Independent domination in bipartite cubic graphs
- Total forcing versus total domination in cubic graphs
- An improved upper bound on the independent domination number in cubic graphs of girth at least six
- Bounds on domination parameters in graphs: a brief survey
- Power domination in cubic graphs and Cartesian products
- Semipaired domination in claw-free cubic graphs
- A new bound on the domination number of connected cubic graphs
- Restrained domination in graphs with minimum degree two
- Domination number of cubic graphs with large girth
- Restrained and Total Restrained Domination in Graphs
- Independent Domination in Cubic Graphs
- Domination in graphs with minimum degree two
- Paths, Stars and the Number Three
- Total Domination in Graphs
- Domination in Graphs: Core Concepts
- Topics in Domination in Graphs
- Domination in Cubic Graphs of Large Girth
This page was built for publication: Best possible upper bounds on the restrained domination number of cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565811)
