A variation of distance domination in composite networks
From MaRDI portal
Publication:6494489
Recommendations
Cites work
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3299758 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- Bounds on the exponential domination number
- Domination with exponential decay
- On covering sets and error-correcting codes
- On exponential domination of \(C_m\times C_n\)
- On exponential domination of some graphs
- Porous exponential domination in Harary graphs
- Relating domination, exponential domination, and porous exponential domination
- Resistance distance and Kirchhoff index of \(R\)-vertex join and \(R\)-edge join of two graphs
- Spectra of \(R\)-vertex join and \(R\)-edge join of two graphs
- Spectra of graph operations based on \(R\)-graph
This page was built for publication: A variation of distance domination in composite networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6494489)