On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\)

DOI10.1016/j.disc.2017.11.005zbMath1378.05110OpenAlexW2776028551MaRDI QIDQ1690230

Jeng-Jung Wang, Lih-Hsing Hsu

Publication date: 19 January 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.11.005

zbMATH Keywords

generalized Petersen graphsvertex-disjoint pathsspanning connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (4)

Sufficient conditions for graphs to be spanning connected ⋮ The bondage number of generalized Petersen graphs \(P(n,2)\) ⋮ Fault tolerance of hypercube like networks: spanning laceability under edge faults ⋮ Super spanning connectivity of split-star networks

Cites Work

• On the spanning connectivity and spanning laceability of hypercube-like networks
• Globally bi-3*-connected graphs
• On the Hamilton connectivity of generalized Petersen graphs
• The classification of Hamiltonian generalized Petersen graphs
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Variations on the Hamiltonian Theme
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\)