The scattering number of thorn graphs

DOI10.1080/00207160410001661681zbMath1055.05092OpenAlexW1991789977MaRDI QIDQ4831402

Alpay Kırlangiç, 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)

Related Items (5)

A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs ⋮ Herscovici's conjecture on the product of the thorn graphs of the complete graphs ⋮ SOME RESULTS FOR THE RUPTURE DEGREE ⋮ Total rainbow connection numbers of some special graphs ⋮ Graham's pebbling conjecture on product of thorn graphs of complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 1-tough cocomparability graphs are hamiltonian
• Measuring the vulnerability for classes of intersection graphs
• A measure of graph vulnerability: Scattering number
• Tough graphs and Hamiltonian circuits.
• Scattering number in graphs
• Edge‐tenacious networks

This page was built for publication: The scattering number of thorn graphs