Edge vulnerability parameters of split graphs
From MaRDI portal
(Redirected from Publication:2371083)
Recommendations
- Edge vulnerability parameters of bisplit graphs
- Vulnerability parameters of split graphs
- Vulnerability of some splitting graphs
- Vulnerability of super connected split graphs and bisplit graphs
- Vulnerability of super extra edge-connected graphs
- Vulnerability parameters of double graphs
- A measure of graphs vulnerability: edge scattering number
- Diameter vulnerability of graphs by edge deletion
- Diameter vulnerability of graphs
- Split domination vertex critical and edge critical graphs
Cites work
- scientific article; zbMATH DE number 4130410 (Why is no real title available?)
- scientific article; zbMATH DE number 4053662 (Why is no real title available?)
- scientific article; zbMATH DE number 4085694 (Why is no real title available?)
- Connectivity and edge-disjoint spanning trees
- Edge-Disjoint Spanning Trees of Finite Graphs
- Graph theory
- On the Problem of Decomposing a Graph into n Connected Factors
- Optimal attack and reinforcement of a network
- The toughness of split graphs
Cited in
(5)- Edge vulnerability parameters of bisplit graphs
- scientific article; zbMATH DE number 7310279 (Why is no real title available?)
- Vulnerability of super connected split graphs and bisplit graphs
- Maximally and super connected multisplit graphs and digraphs
- scientific article; zbMATH DE number 1933267 (Why is no real title available?)
This page was built for publication: Edge vulnerability parameters of split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371083)
