A variation of distance domination in composite networks

DOI10.1002/NUM.22759MaRDI QIDQ6494489zbMATH OpenWikidataFDO

Authors Vecdi Aytac, Fatmana Şentürk

Publication date 30 April 2024

Published in Numerical Methods for Partial Differential Equations (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NUM.22759

zbMATH Keywords

graph operationsgraph theoryporous exponential dominationR-coronaR-join

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Porous exponential domination in Harary graphs
• Exponential Domination Critical and Stability in Some Graphs
• On exponential domination and graph operations
• Domination with exponential decay
• On exponential domination of some graphs

Cites work

• Bounds on the exponential domination number
• Domination with exponential decay
• 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?)
• 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)