Analysis of Vulnerability of Some Transformation Networks

DOI10.1142/S0129054122500162MaRDI QIDQ6169956zbMATH OpenOpenAlexFDO

Authors Vecdi Aytac, Tufan Turaci

Publication date 15 August 2023

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054122500162

zbMATH Keywords

disjunctive total domination numberdistancedomination numbertransformation graphsvulnerability

Mathematics Subject Classification ID

Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On vulnerability measures of networks
• scientific article; zbMATH DE number 2100568
• Information and Communications Security
• Computational complexity of network vulnerability analysis
• Vulnerability of complex network structures and systems
• A vulnerability parameter of networks

Cites work

• Basic properties of total transformation graphs
• Bounds on the disjunctive total domination number of a tree
• Combining the concepts of residual and domination in graphs
• Disjunctive total domination in graphs
• Disjunctive Total Domination Subdivision Number of Graphs
• Domination with exponential decay
• Graphs with large disjunctive total domination number
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• On combining the methods of link residual and domination in networks
• On domination of a vertex as exponentially
• On exponential domination of some graphs
• On the domination, strong and weak domination in transformation graph \(G^{xy-}\)
• The disjunctive domination number of a graph
• The transformation graph \(G^{xyz}\) when \(xyz=-++\)
• Total domination in graphs
• Total domination in graphs
• Transformation graph \(G^{-+-}\)
• Vulnerability Measures of Transformation Graph G^xy+
• Vulnerability of complex networks

Cited in

(3)

• The vulnerability of some networks including cycles via domination parameters
• On combining the methods of link residual and domination in networks
• Some general results on paired disjunctive domination and calculations in certain Mycielski graphs

This page was built for publication: Analysis of Vulnerability of Some Transformation Networks

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