Component connectivity of generalized Petersen graphs

DOI10.1080/00207160.2013.878023zbMath1408.05077OpenAlexW2095201606MaRDI QIDQ2931939

Sarah Hanusch, Daniela Ferrero

Publication date: 28 November 2014

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

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

zbMATH Keywords

connectivitygeneralized Petersen graphsedge connectivitycomponent connectivity

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (5)

On the reliability of generalized Petersen graphs ⋮ Structural and computational results on platypus graphs ⋮ The strong metric dimension of some generalized Petersen graphs ⋮ Component connectivity of the data center network dcell ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs

Cites Work

• The isomorphism classes of the generalized Petersen graphs
• Component connectivity of the hypercubes
• A theorem on tait colorings with an application to the generalized Petersen graphs
• I-graphs and the corresponding configurations
• Self-dual configurations and regular graphs

This page was built for publication: Component connectivity of generalized Petersen graphs