A variation of distance domination in composite networks
From MaRDI portal
Publication:6494489
DOI10.1002/NUM.22759WikidataQ115397393 ScholiaQ115397393MaRDI QIDQ6494489FDOQ6494489
Authors: Vecdi Aytac, Fatmana Şentürk
Publication date: 30 April 2024
Published in: Numerical Methods for Partial Differential Equations (Search for Journal in Brave)
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Resistance distance and Kirchhoff index of \(R\)-vertex join and \(R\)-edge join of two graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectra of graph operations based on \(R\)-graph
- Title not available (Why is that?)
- Domination with exponential decay
- Bounds on the exponential domination number
- On exponential domination of \(C_m\times C_n\)
- On covering sets and error-correcting codes
- On exponential domination of some graphs
- Relating domination, exponential domination, and porous exponential domination
- Porous exponential domination in Harary graphs
- Spectra of \(R\)-vertex join and \(R\)-edge join of two graphs
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)