scientific article; zbMATH DE number 861347
From MaRDI portal
Publication:4871072
zbMATH Open0845.05088MaRDI QIDQ4871072FDOQ4871072
Authors: M. Cozzens, Dara Moazzami, Sam Stueckle 
Publication date: 21 May 1996
Title of this publication is not available (Why is that?)
Recommendations
Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40) Graph theory (05C99)
Cited In (46)
- Node and link vulnerability in complete multipartite networks
- Bounds for different spreads of line and total graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the neighbour-integrity of sequential joined graphs
- On the first-order edge tenacity of a graph
- Network robustness and residual closeness
- On the edge-tenacity of the middle graph of a graph
- Extreme tenacity of graphs with given order and size
- Binding number and tenacity
- Tenacity of a graph with maximum connectivity
- Graph vulnerability parameters, compression, and quasi-threshold graphs
- Some results related to the tenacity and existence of \(k\)-trees
- On agglomeration-based rupture degree in networks and a heuristic algorithm
- A note on the link residual closeness of graphs under join operation
- Vertex vulnerability parameters of Kronecker products of complete graphs
- On the edge-tenacity of graphs
- Neighbor Isolated Tenacity of Graphs
- Computing the tenacity of some graphs
- The scattering number of strictly chordal graphs: linear time determination
- Recognizing tenacious graphs is NP-hard.
- On the higher-order edge-tenacity of a graph
- Link vulnerability in networks
- Title not available (Why is that?)
- Extremal graphs with given order and the rupture degree
- The weak hyperedge tenacity of the hypercycles
- Tree-core and tree-coritivity of graphs
- The rupture degree of trees
- A note on ``Tenacity of a graph with maximum connectivity
- Tenacity-maximum graphs
- Tenacity of complete graph products and grids
- Computational complexity of network vulnerability analysis
- The common-neighbourhood of a graph
- Tenacity of total graphs
- Relationships between rupture degree and other parameters
- On edge-rupture degree of graphs
- Computing the Scattering Number of Graphs
- Title not available (Why is that?)
- Stability measures of some static interconnection networks
- The vertex attack tolerance of complex networks
- Robustness of random graphs based on graph spectra
- Spectral bounds for the vulnerability parameters of graphs
- Isolated scattering number of split graphs and graph products
- Edge‐tenacious networks
- \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs
- Vulnerability of nearest neighbor 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)
