A survey of integrity
From MaRDI portal
Publication:1199410
DOI10.1016/0166-218X(92)90122-QzbMath0778.05041MaRDI QIDQ1199410
Wayne Goddard, K. S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert
Publication date: 16 January 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15)
Related Items (42)
The neighbour-integrity of total graphs ⋮ Integrity of graph operations ⋮ Weak-Rupture Degree of Graphs ⋮ Integrity of total transformation graphs ⋮ Some operations in hub-integrity of graphs ⋮ Neighbor Isolated Tenacity of Graphs ⋮ Finding a fault tolerant routing on neighbour-faulty hypercube ⋮ Largest component and node fault tolerance for grids ⋮ Safe number and integrity of graphs ⋮ On agglomeration-based rupture degree in networks and a heuristic algorithm ⋮ A note on the integrity of grids ⋮ Porous exponential domination number of some graphs ⋮ Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time ⋮ Diametral path graphs ⋮ TOTAL DOMINATION INTEGRITY OF WHEEL RELATED GRAPHS ⋮ Weak and strong domination in thorn graphs ⋮ A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees ⋮ A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs ⋮ Exponential Independence Number of Some Graphs ⋮ Stability measures of some static interconnection networks ⋮ On the range of possible integrities of graphs \(G(n, k)\) ⋮ A kind of conditional connectivity of Cayley graphs generated by wheel graphs ⋮ Graph vulnerability parameters, compression, and quasi-threshold graphs ⋮ Network majority on tree topological network ⋮ The critical node detection problem in networks: a survey ⋮ COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS ⋮ New upper bounds for the integrity of cubic graphs ⋮ SOME RESULTS FOR THE RUPTURE DEGREE ⋮ Vertex vulnerability parameters of Kronecker products of complete graphs ⋮ Vulnerability in graphs: the neighbour-integrity of line graphs ⋮ The neighbour-integrity of boolean graphs and its compounds ⋮ On the computational complexity of vertex integrity and component order connectivity ⋮ On the neighbour-integrity of sequential joined graphs ⋮ A vulnerability parameter of networks ⋮ Domination integrity of some graph classes ⋮ Unnamed Item ⋮ The integrity of a cubic graph ⋮ Global distribution center number of some graphs and an algorithm ⋮ Bounded degree spanners of the hypercube ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Edge-integrity: A survey
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
- Edge-integrity: A survey
- On the honesty of graph complements
- On the edge-integrity of some graphs and their complements
- On the Toughness of a Graph
- Measures of vulnerability–the integrity family
This page was built for publication: A survey of integrity
