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

DOI10.1016/J.DISC.2017.11.005zbMATH Open1378.05110OpenAlexW2776028551MaRDI QIDQ1690230FDOQ1690230

Authors: 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

Recommendations

• 2-spanning cyclability problems of some generalized Petersen graphs
• On \(3^*\)-connected graphs
• Spanning 3-connected index of graphs
• Hamiltonian connectedness of the generalized Petersen graph \(GP(n,4)\)
• Hamilton paths in generalized Petersen graphs

zbMATH Keywords

generalized Petersen graphsvertex-disjoint pathsspanning connected graph

Mathematics Subject Classification ID

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

Cites Work

• A theorem on tait colorings with an application to the generalized Petersen graphs
• On the Hamilton connectivity of generalized Petersen graphs
• On the spanning connectivity and spanning laceability of hypercube-like networks
• Title not available (Why is that?)
• The classification of Hamiltonian generalized Petersen graphs
• On \(3^*\)-connected graphs
• Variations on the Hamiltonian Theme
• Globally bi-3*-connected graphs
• Hamiltonian connectedness of the generalized Petersen graph \(GP(n,4)\)
• Title not available (Why is that?)

Cited In (4)

• Super spanning connectivity of split-star networks
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690230)