Neighborhood outer split domination in graphs
From MaRDI portal
Publication:5036679
Recommendations
Cites work
- _t-graph of a graph G
- A note on split domination number of a graph
- Characterization of total very excellent trees
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Induced subgraphs of gamma graphs
- Neighborhood connected domination in graphs
- Neighborhood connected perfect domination in graphs
- Neighbourhood total domination in graphs
- Semi-strong split domination in graphs
- The common minimal total dominating graph
- Upper bounds on the total domination number
Cited in
(5)- Reinforcement number of a graph with respect to half-domination
- scientific article; zbMATH DE number 1805993 (Why is no real title available?)
- Split domination number of divisible dominating graphs
- scientific article; zbMATH DE number 2204095 (Why is no real title available?)
- On -split domination in graphs
This page was built for publication: Neighborhood outer split domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5036679)