The diameter vulnerability of the generalized Petersen graph GP[tk,k]
From MaRDI portal
Publication:4633381
DOI10.3906/MAT-1802-66zbMATH Open1424.05064OpenAlexW2950659515MaRDI QIDQ4633381FDOQ4633381
Authors: Gülnaz Boruzanlı Ekinci, John Baptist Gauci 
Publication date: 2 May 2019
Published in: Turkish Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3906/mat-1802-66
Recommendations
Distance in graphs (05C12) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Cites Work
- Restricted connectivity for three families of interconnection networks
- Diameter bounds for altered graphs
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Self-dual configurations and regular graphs
- Fault diameter of interconnection networks
- Fault-tolerant diameter for three family interconnection networks
- Diameter increase caused by edge deletion
- Fault-tolerant analysis of a class of networks
- Title not available (Why is that?)
- The vulnerability of the diameter of folded \(n\)-cubes
- Diameter vulnerability of graphs by edge deletion
- Title not available (Why is that?)
- A study of odd graphs as fault-tolerant interconnection networks
- Wide diameter of generalized Petersen graphs
- On the reliability of generalized Petersen graphs
- The vulnerability of the diameter of the enhanced hypercubes
Cited In (8)
- On the diameter of generalized Petersen graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Diameter vulnerability of GC graphs
- Diameter vulnerability of directed cycles and directed tori
- Wide diameter of generalized Petersen graphs
- Title not available (Why is that?)
- 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)
