Graph vulnerability parameters, compression, and quasi-threshold graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4053662 (Why is no real title available?)
- scientific article; zbMATH DE number 718660 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1472195 (Why is no real title available?)
- scientific article; zbMATH DE number 1501969 (Why is no real title available?)
- scientific article; zbMATH DE number 861347 (Why is no real title available?)
- A reliability-improving graph transformation with applications to network reliability
- A survey of integrity
- Applications of the Kelmans transformation: extremality of the threshold graphs
- Extremal graphs for homomorphisms
- Extremal graphs for homomorphisms. II
- Graphs with the fewest matchings
- Graphs with the maximum or minimum number of 1-factors
- Least reliable networks and the reliability domination
- Network transformations and bounding network reliability
- On a conjecture of V. Nikiforov
- On graphs with randomly deleted edges
- Rupture degree of graphs
- Threshold graphs and related topics
- Undirected simple connected graphs with minimum number of spanning trees
Cited in
(3)
This page was built for publication: Graph vulnerability parameters, compression, and quasi-threshold graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1735681)