scientific article; zbMATH DE number 7310279
From MaRDI portal
Publication:5150664
Publication date: 15 February 2021
Full work available at URL: http://mathnet.ru/eng/pdm478
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
graphsvulnerabilitytenacitytoughnessnetwork reliabilityintegrityscattering numberrupture degreedomination integrityneighbour integrity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integrity of total graphs via certain parameters
- On the computational complexity of vertex integrity and component order connectivity
- Recognizing tough graphs is NP-hard
- A survey of integrity
- Application of symmetry theory to the analysis and synthesis of fault-tolerant systems
- Edge-integrity: A survey
- Toughness and edge-toughness
- Measuring the vulnerability for classes of intersection graphs
- The toughness of split graphs
- Optimizing the fault-tolerant embedding of the diagnostic graph into the toroidal structures of robust computer systems
- The integrity of a cubic graph
- An invariant-group approach to investigation of \(k\)-fault-tolerant structures
- Edge vulnerability parameters of split graphs
- Calculation of the accessibility number and the neighbor integrity of a graph
- Tough graphs and Hamiltonian circuits.
- The Valve Location Problem in Simple Network Topologies
- Lower bounds for the domination number
- A Graph Model for Fault-Tolerant Computing Systems
- New upper bounds for the integrity of cubic graphs
- Edge‐tenacious networks
- Computing the Scattering Number of Graphs
- The Ordered Set of Connected Parts of a Polygonal Graph
- Vulnerability parameters of split graphs
This page was built for publication:
