Signed mixed dominating functions in complete bipartite graphs
From MaRDI portal
Recommendations
Cites work
- A lower bound on the total signed domination numbers of graphs
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- On the mixed domination problem in graphs
- On total matching numbers and total covering numbers of complementary graphs
- Signed total \((k,k)\)-domatic number of digraphs
- Signed total k-domatic numbers of graphs
- Signed Total Domination Nnumber of a Graph
- The algorithmic complexity of mixed domination in graphs
- Total matchings and total coverings of graphs
Cited in
(5)
This page was built for publication: Signed mixed dominating functions in complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259070)