Disjunctive total domination in permutation graphs
From MaRDI portal
Recommendations
Cites work
- A survey of selected recent results on total domination in graphs
- Disjunctive total domination in graphs
- Domination in functigraphs
- Domination of generalized Cartesian products
- Domination with exponential decay
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- 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 3259770 (Why is no real title available?)
- scientific article; zbMATH DE number 3358515 (Why is no real title available?)
- On dominating the Cartesian product of a graph and K2
- On restricted connectivities of permutation graphs
- On the domination number of prisms of graphs
- Relations between packing and covering numbers of a tree
- The disjunctive domination number of a graph
- Total domination in graphs
- Towards a theory of domination in graphs
Cited in
(6)- On the domination number of permutation graphs and an application to strong fixed points
- On the broadcast domination number of permutation graphs
- Graphs with diameter 2 and large total domination number
- The disjunctive domination number of a graph
- Disjunctive total domination stability in graphs
- On disjunctive domination in graphs
This page was built for publication: Disjunctive total domination in permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2966509)