scientific article; zbMATH DE number 1339493
From MaRDI portal
Publication:4264550
Cited in
(26)- Some results related to the tenacity and existence of \(k\)-trees
- A large class of maximally tough graphs
- Measuring the vulnerability for classes of intersection graphs
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
- Graph vulnerability parameters, compression, and quasi-threshold graphs
- Vulnerability of subclasses of chordal graphs
- Graph vulnerability parameters, compression, and threshold graphs
- A metric to compare vulnerability of the graphs of different sizes
- Vulnerability of nearest neighbor graphs
- Edge vulnerability parameters of bisplit graphs
- A note on ``Tenacity of a graph with maximum connectivity
- On the first-order edge tenacity of a graph
- Vulnerability parameters of tensor product of complete equipartite graphs
- On large ( , D, D, 1)-graphs
- Vulnerability Measures of Transformation Graph Gxy+
- The minimum vulnerability problem on specific graph classes
- scientific article; zbMATH DE number 4053662 (Why is no real title available?)
- Extremal connectivity and vulnerability in graphs
- scientific article; zbMATH DE number 21737 (Why is no real title available?)
- scientific article; zbMATH DE number 1933267 (Why is no real title available?)
- The common-neighbourhood of a graph
- scientific article; zbMATH DE number 5856 (Why is no real title available?)
- scientific article; zbMATH DE number 7310279 (Why is no real title available?)
- The weak hyperedge tenacity of the hypercycles
- Vulnerability of some splitting graphs
- Tenacity of a graph with maximum connectivity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4264550)
