Vulnerability parameters of split graphs
From MaRDI portal
Recommendations
Cites work
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Computing the Scattering Number of Graphs
- Graph theory with applications
- On a class of posets and the corresponding comparability graphs
- Rupture degree of graphs
- Scattering number in graphs
- The toughness of split graphs
- Tough graphs and Hamiltonian circuits.
Cited in
(16)- The neighbour-scattering number can be computed in polynomial time for interval graphs
- Measuring the vulnerability for classes of intersection graphs
- A complete characterization of bidegreed split graphs with four distinct signless Laplacian eigenvalues
- Vulnerability of super connected split graphs and bisplit graphs
- Edge vulnerability parameters of split graphs
- Edge vulnerability parameters of bisplit graphs
- Toughness of the corona of two graphs
- Maximally and super connected multisplit graphs and digraphs
- Parameterized complexity of safe set
- scientific article; zbMATH DE number 7310279 (Why is no real title available?)
- Vulnerability of some splitting graphs
- Isolated scattering number of split graphs and graph products
- Structural parameterizations of vertex integrity (best paper)
- Structural parameterizations of vertex integrity
- Combining crown structures for vulnerability measures
- Combining crown structures for vulnerability measures
This page was built for publication: Vulnerability parameters of split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5438691)