The diameter vulnerability of the generalized Petersen graph GP[tk,k]
From MaRDI portal
Publication:4633381
Recommendations
Cites work
- scientific article; zbMATH DE number 3831957 (Why is no real title available?)
- scientific article; zbMATH DE number 3908346 (Why is no real title available?)
- A study of odd graphs as fault-tolerant interconnection networks
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Diameter bounds for altered graphs
- Diameter increase caused by edge deletion
- Diameter vulnerability of graphs by edge deletion
- Fault diameter of interconnection networks
- Fault-tolerant analysis of a class of networks
- Fault-tolerant diameter for three family interconnection networks
- On the reliability of generalized Petersen graphs
- Restricted connectivity for three families of interconnection networks
- Self-dual configurations and regular graphs
- The vulnerability of the diameter of folded \(n\)-cubes
- The vulnerability of the diameter of the enhanced hypercubes
- Wide diameter of generalized Petersen graphs
Cited in
(8)- On the diameter of generalized Petersen graphs
- scientific article; zbMATH DE number 2114049 (Why is no real title available?)
- scientific article; zbMATH DE number 4068910 (Why is no real title available?)
- Diameter vulnerability of GC graphs
- Diameter vulnerability of directed cycles and directed tori
- Wide diameter of generalized Petersen graphs
- scientific article; zbMATH DE number 3908346 (Why is no real title available?)
- Vulnerability of communication networks
This page was built for publication: The diameter vulnerability of the generalized Petersen graph \(GP[tk,k]\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633381)