Total domination versus domination in cubic graphs
From MaRDI portal
Publication:1706439
DOI10.1007/s00373-017-1865-5zbMath1382.05052OpenAlexW2779162822MaRDI QIDQ1706439
Magdalena Lemańska, Joanna Cyman, Joanna Raczek, Michael A. Henning, Magda Dettlaff
Publication date: 22 March 2018
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1865-5
cubic graphdomination numbertotal domination numberupper domination numberupper total domination number
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (7)
Total double Roman domination in graphs ⋮ A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ An algorithm to check the equality of total domination number and double of domination number in graphs ⋮ On upper total domination versus upper domination in graphs ⋮ Domination versus total domination in claw-free cubic graphs ⋮ Upper total domination in claw-free cubic graphs ⋮ Triangles and (total) domination in subcubic graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total dominating sequences in graphs
- A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
- On the upper total domination number of Cartesian products of graphs
- A survey of selected recent results on total domination in graphs
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Total Domination in Graphs with Diameter 2
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Hypergraphs with large transversal number and with edge sizes at least 3
- Total domination in graphs
- Some remarks on domination
- Graphs with large total domination number
- Total Domination in Graphs
- Edge Weighting Functions on Dominating Sets
This page was built for publication: Total domination versus domination in cubic graphs
