A vulnerability parameter of networks

DOI10.1134/S0001434621030202MaRDI QIDQ2037692zbMATH OpenOpenAlexFDO

Authors C. Çiftçi, Aysun Aytaç

Publication date 8 July 2021

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0001434621030202

zbMATH Keywords

Cartesian productdominationexponential dominationgraph vulnerabilitylexicographic productnetwork design and communicationporous exponential domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication theory (94A05)

Recommendations

• scientific article; zbMATH DE number 1735721
• On vulnerability measures of networks
• Link vulnerability in networks
• Vulnerability of complex networks
• scientific article; zbMATH DE number 3908346
• Vulnerability of Interdependent Networks and Networks of Networks
• Vulnerability of complex network structures and systems
• scientific article; zbMATH DE number 6836971
• Vulnerability of weighted networks

Cites work

• A survey of integrity
• Bounds on the exponential domination number
• Domination with exponential decay
• Graphs with given connectivity properties
• Hereditary equality of domination and exponential domination
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1124605 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 6761041 (Why is no real title available?)
• On exponential domination of \(C_m\times C_n\)
• On Maximal Circuits in Finite Graphs
• On the group of the composition of two graphs
• Porous exponential domination in Harary graphs
• Porous exponential domination number of some graphs
• Relating domination, exponential domination, and porous exponential domination
• Tough graphs and Hamiltonian circuits.

Cited in

(5)

• The vulnerability of some networks including cycles via domination parameters
• scientific article; zbMATH DE number 6836971 (Why is no real title available?)
• scientific article; zbMATH DE number 1735721 (Why is no real title available?)
• On domination of a vertex as exponentially
• Analysis of Vulnerability of Some Transformation Networks

This page was built for publication: A vulnerability parameter of networks

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