Signed edge k-domination numbers in graphs
From MaRDI portal
Publication:2908700
Recommendations
Cited in
(17)- scientific article; zbMATH DE number 7390800 (Why is no real title available?)
- Signed Stark-subdomination numbers in graphs
- Some notes on signed edge domination in graphs
- On the signed edge domination numbers of \(K_{m,n}\).
- scientific article; zbMATH DE number 7132819 (Why is no real title available?)
- Signed edge \(k\)-subdomination numbers in graphs
- On the signed edge domination number of graphs
- Signed edge domination numbers of complete tripartite graphs. I.
- On signed edge distance-1-domination in graphs
- On the characterization of trees with signed edge domination numbers 1, 2, 3, or 4
- Signed clique edge domination numbers of graphs
- Signed Roman edge \(k\)-domination in graphs
- Signed edge domination numbers of complete tripartite graphs. II
- Bounds of the signed edge domination number of complete multipartite graphs
- Signed distance \(k\)-domatic numbers of graphs
- The signed edge total \(k\)-domination numbers of graphs
- k-signed edge domination numbers in graphs
This page was built for publication: Signed edge \(k\)-domination numbers in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908700)