A variation of distance domination in composite networks

DOI10.1002/NUM.22759WikidataQ115397393 ScholiaQ115397393MaRDI QIDQ6494489

Fatmana Şentürk, Vecdi Aytac

Publication date: 30 April 2024

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

zbMATH Keywords

graph theorygraph operationsporous 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)

Cites Work

• On exponential domination of \(C_m\times C_n\)
• Bounds on the exponential domination number
• Domination with exponential decay
• Relating domination, exponential domination, and porous exponential domination
• Porous exponential domination in Harary graphs
• Resistance distance and Kirchhoff index of \(R\)-vertex join and \(R\)-edge join of two graphs
• On covering sets and error-correcting codes
• Spectra of graph operations based onR-graph
• Spectra of R-vertex join and R-edge join of two graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A variation of distance domination in composite networks