The diameter vulnerability of the generalized Petersen graphGP[tk;k]
From MaRDI portal
Publication:4633381
DOI10.3906/mat-1802-66zbMath1424.05064OpenAlexW2950659515MaRDI QIDQ4633381
John Baptist Gauci, Gülnaz Boruzanlı Ekinci
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
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault-tolerant diameter for three family interconnection networks
- Diameter vulnerability of graphs by edge deletion
- Fault diameter of interconnection networks
- The vulnerability of the diameter of folded \(n\)-cubes
- On the reliability of generalized Petersen graphs
- Restricted connectivity for three families of interconnection networks
- Fault-tolerant analysis of a class of networks
- The vulnerability of the diameter of the enhanced hypercubes
- Diameter increase caused by edge deletion
- A study of odd graphs as fault-tolerant 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
This page was built for publication: The diameter vulnerability of the generalized Petersen graphGP[tk;k]