Bounds on neighborhood total domination in graphs
From MaRDI portal
Publication:2444537
Recommendations
Cites work
- A survey of selected recent results on total domination in graphs
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1529462 (Why is no real title available?)
- Neighbourhood total domination in graphs
- Restrained domination in graphs with minimum degree two
- Total domination in graphs
- Total domination in graphs
Cited in
(12)- Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs
- Algorithm and hardness results on neighborhood total domination in graphs
- Bounds on neighborhood total domination number in graphs
- Trees with large neighborhood total domination number
- Neighborhood total domination of a graph and its complement
- Neighbourhood total domination in graphs
- scientific article; zbMATH DE number 436064 (Why is no real title available?)
- Matchings, path covers and domination
- scientific article; zbMATH DE number 6902661 (Why is no real title available?)
- Total global neighbourhood domination
- Neighborhood total 2-domination in graphs
- A note on neighborhood total domination in graphs
This page was built for publication: Bounds on neighborhood total domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444537)