The scattering number of thorn graphs
From MaRDI portal
Publication:4831402
DOI10.1080/00207160410001661681zbMATH Open1055.05092OpenAlexW1991789977MaRDI QIDQ4831402FDOQ4831402
Publication date: 29 December 2004
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160410001661681
Cites Work
- Edge‐tenacious networks
- Measuring the vulnerability for classes of intersection graphs
- Tough graphs and Hamiltonian circuits.
- 1-tough cocomparability graphs are hamiltonian
- A measure of graph vulnerability: Scattering number
- Scattering number in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Title not available (Why is that?)
- SOME RESULTS FOR THE RUPTURE DEGREE
- Herscovici's conjecture on the product of the thorn graphs of the complete graphs
- A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
- Graham's pebbling conjecture on product of thorn graphs of complete graphs
- Total rainbow connection numbers of some special graphs
This page was built for publication: The scattering number of thorn graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4831402)
