Trees with large total domination number
From MaRDI portal
Recommendations
Cited in
(23)- On total domination in the Cartesian product of graphs
- Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs
- Total domination versus domination in cubic graphs
- Total domination and least domination in a tree
- On trees with unique locating kernels
- Trees with extremal numbers of \(k\)-dominating sets
- Trees with large neighborhood total domination number
- Relating the total \(\{2\}\)-domination number with the total domination number of graphs
- A characterization of (_t,_2)-trees
- A note on non-dominating set partitions in graphs
- scientific article; zbMATH DE number 5302585 (Why is no real title available?)
- scientific article; zbMATH DE number 5305008 (Why is no real title available?)
- Domination and total domination in cubic graphs of large girth
- On a class of graphs with large total domination number
- An algorithm to check the equality of total domination number and double of domination number in graphs
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- Relating ordinary and total domination in cubic graphs of large girth
- On total domination and minimum maximal matchings in graphs
- The number of dominating sets in d-ary trees
- The number of total dominating sets in binary trees
- Bondage numbers of Mycielski graphs
- Total outer-connected domination numbers of trees
- A survey of selected recent results on total domination in graphs
This page was built for publication: Trees with large total domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770439)
