On domination of a vertex as exponentially

MaRDI QIDQ5233379zbMATH OpenFDO

Authors B. Atay, Aysun Aytaç

Publication date 10 September 2019

zbMATH Keywords

communication networkcyclesdominationexponential domination numbergraph vulnerabilitynetwork design and communicationstability

Mathematics Subject Classification ID

Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Network design and communication in computer systems (68M10)

Recommendations

• On exponential edge domination number of a graph
• scientific article; zbMATH DE number 7033851
• A vulnerability parameter of networks
• The vulnerability of some networks including cycles via domination parameters
• scientific article; zbMATH DE number 6761041

Cited in

(4)

• The vulnerability of some networks including cycles via domination parameters
• Porous exponential domination in Harary graphs
• Exponential Domination Critical and Stability in Some Graphs
• Analysis of Vulnerability of Some Transformation Networks

This page was built for publication: On domination of a vertex as exponentially

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233379)