On the superconnectivity of generalized p-cycles

DOI10.1016/S0012-365X(01)00383-1MaRDI QIDQ1849872zbMATH OpenFDO

Authors Yanyan Li

Publication date 2 December 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(01)00383-1

zbMATH Keywords

digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Recommendations

• On the connectivity of generalized p-cycles.
• Restricted arc-connectivity of generalized \(p\)-cycles
• Superconnected circulant digraphs
• scientific article; zbMATH DE number 2188350
• Circulants and their connectivities

Cited in

(8)

• Sufficient conditions for '-optimality in graphs of diameter 2
• Minimum cuts of distance-regular digraphs
• Hamiltonicity of large generalized de Bruijn cycles
• On the connectivity of generalized p-cycles.
• Circulants and their connectivities
• Restricted arc-connectivity of generalized \(p\)-cycles
• Directed cycle k-connectivity of complete digraphs and complete regular bipartite digraphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey

This page was built for publication: On the superconnectivity of generalized \(p\)-cycles

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