Analysis of Vulnerability of Some Transformation Networks
From MaRDI portal
Publication:6169956
DOI10.1142/s0129054122500162zbMath1519.05186OpenAlexW4285801771MaRDI QIDQ6169956
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
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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Disjunctive total domination in graphs
- Vulnerability of complex networks
- Bounds on the disjunctive total domination number of a tree
- Domination with exponential decay
- The transformation graph \(G^{xyz}\) when \(xyz=-++\)
- Transformation graph \(G^{-+-}\)
- The disjunctive domination number of a graph
- Vulnerability Measures of Transformation Graph Gxy+
- Total domination in graphs
- Total Domination in Graphs
- Disjunctive Total Domination Subdivision Number of Graphs
- On Combining the Methods of Link Residual and Domination in Networks
- Combining the Concepts of Residual and Domination in Graphs
- Graphs with Large Disjunctive Total Domination Number
This page was built for publication: Analysis of Vulnerability of Some Transformation Networks