One node fault tolerance for caterpillars and starlike trees

DOI10.1080/00207169508804394zbMath0847.68081OpenAlexW2140494360MaRDI QIDQ4876347

Mohammed Khurrum, Frank Harary

Publication date: 23 June 1996

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169508804394

zbMATH Keywords

supergraphcaterpillarstarlike trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

T-irreducible Extensions for Starlike Trees ⋮ Unnamed Item

Cites Work

• On sparse graphs with dense long paths
• The number of caterpillars
• MinimumK-hamiltonian graphs
• Minimumk-hamiltonian graphs, II
• Designing optimal fault-tolerant star networks
• An optimal 2-FT realization of binary symmetric hierarchical tree systems
• Edge fault tolerance in graphs
• Trees with Hamiltonian square

This page was built for publication: One node fault tolerance for caterpillars and starlike trees