The scattering number of thorn graphs

DOI10.1080/00207160410001661681MaRDI QIDQ4831402zbMATH OpenOpenAlexFDO

Authors Alpay Kirlangic, Aysun Aytaç

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

zbMATH Keywords

stabilityscattering number

Mathematics Subject Classification ID

Connectivity (05C40)

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1484052 (Why is no real title available?)
• 1-tough cocomparability graphs are hamiltonian
• A measure of graph vulnerability: Scattering number
• Edge‐tenacious networks
• Measuring the vulnerability for classes of intersection graphs
• Scattering number in graphs
• Tough graphs and Hamiltonian circuits.

Cited in

(6)

• scientific article; zbMATH DE number 7410256 (Why is no real title available?)
• 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
• Some results for the rupture degree

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)