scientific article; zbMATH DE number 861347
From MaRDI portal
Publication:4871072
Recommendations
Cited in
(51)- Some results related to the tenacity and existence of \(k\)-trees
- On edge-rupture degree of graphs
- Graph vulnerability parameters, compression, and quasi-threshold graphs
- -connectivity, integrity, tenacity, toughness and eigenvalues of graphs
- The scattering number of strictly chordal graphs: linear time determination
- Bounds for different spreads of line and total graphs
- Tree-core and tree-coritivity of graphs
- Vulnerability of nearest neighbor graphs
- A note on ``Tenacity of a graph with maximum connectivity
- On the first-order edge tenacity of a graph
- Stability measures of some static interconnection networks
- Tenacity-maximum graphs
- Tenacity of complete graph products and grids
- Tenacity of total graphs
- Binding number and tenacity
- Robustness of random graphs based on graph spectra
- Neighbor Isolated Tenacity of Graphs
- Relationships between rupture degree and other parameters
- The rupture degree of trees
- On the edge-tenacity of graphs
- scientific article; zbMATH DE number 1339493 (Why is no real title available?)
- scientific article; zbMATH DE number 718660 (Why is no real title available?)
- scientific article; zbMATH DE number 1501969 (Why is no real title available?)
- The vertex attack tolerance of complex networks
- Network robustness and residual closeness
- The common-neighbourhood of a graph
- Link vulnerability in networks
- On the higher-order edge-tenacity of a graph
- Edge‐tenacious networks
- scientific article; zbMATH DE number 1932339 (Why is no real title available?)
- Computing the Scattering Number of Graphs
- Extreme tenacity of graphs with given order and size
- scientific article; zbMATH DE number 1439431 (Why is no real title available?)
- On the neighbour-integrity of sequential joined graphs
- The weak hyperedge tenacity of the hypercycles
- Computing the tenacity of some graphs
- Isolated scattering number of split graphs and graph products
- A note on the link residual closeness of graphs under join operation
- On the edge-tenacity of the middle graph of a graph
- scientific article; zbMATH DE number 2197993 (Why is no real title available?)
- Recognizing tenacious graphs is NP-hard.
- scientific article; zbMATH DE number 2230273 (Why is no real title available?)
- On agglomeration-based rupture degree in networks and a heuristic algorithm
- Spectral bounds for the vulnerability parameters of graphs
- Extremal graphs with given order and the rupture degree
- Computational complexity of network vulnerability analysis
- Tenacity of a graph with maximum connectivity
- Node and link vulnerability in complete multipartite networks
- Isolated scattering number can be computed in polynomial time for interval graphs
- Fuzzy node rupture degree of some fuzzy graph families
- Vertex vulnerability parameters of Kronecker products of complete graphs
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 Q4871072)
