Isolated scattering number of split graphs and graph products
From MaRDI portal
Recommendations
Cites work
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A finite automata approach to modeling the cross product of interconnection networks.
- Computing the Scattering Number of Graphs
- Geometric algorithms and combinatorial optimization
- Graph theory with applications
- scientific article; zbMATH DE number 4053662 (Why is no real title available?)
- scientific article; zbMATH DE number 861347 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- Hypercubes As Direct Products
- Independent sets in tensor graph powers
- On isolated rupture degree of graphs
- On Maximal Circuits in Finite Graphs
- Rupture degree of graphs
- Split Graphs Having Dilworth Number Two
- The isolated scattering number of graphs
- The toughness of split graphs
- Tough graphs and Hamiltonian circuits.
- Vertex vulnerability parameters of Kronecker products of complete graphs
- Vulnerability parameters of split graphs
Cited in
(5)
This page was built for publication: Isolated scattering number of split graphs and graph products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370790)