Double-super-connected digraphs

DOI10.1016/J.DAM.2010.02.004MaRDI QIDQ708328zbMATH OpenOpenAlexFDO

Authors Juan Liu, Zhao Zhang, Jixiang Meng

Publication date 11 October 2010

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

Full work available at URL https://doi.org/10.1016/j.dam.2010.02.004

zbMATH Keywords

super-connectedCartesian productlexicographic productline digraphsdouble-super-connected

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Bi-super-connected digraphs
• Super-connected arc-transitive digraphs
• Super-connected and super-arc-connected Cartesian product of digraphs
• Sufficient conditions for digraphs to be maximally connected and super-connected
• The superconnectivity of large digraphs and graphs

Cites work

• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• scientific article; zbMATH DE number 857069 (Why is no real title available?)
• Subsets with small sums in abelian groups. I: The Vosper property
• Super connectivity of line graphs
• Super edge- and point-connectivities of the Cartesian product of regular graphs
• Super-connected and super-arc-connected Cartesian product of digraphs
• Super-connected arc-transitive digraphs
• Vosperian and superconnected abelian Cayley digraphs

Cited in

(11)

• Super-mixed-connected line digraphs.
• scientific article; zbMATH DE number 7378386 (Why is no real title available?)
• Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity
• Minimum cuts of distance-regular digraphs
• Super-arc-connected and super-connected total digraphs
• Bi-super-connected digraphs
• Super connectivity of line graphs and digraphs
• Maximum size of digraphs with some parameters
• Arc fault tolerance of Cartesian product digraphs on hyper arc connectivity
• Superconnected circulant digraphs
• The properties of middle digraphs.

This page was built for publication: Double-super-connected digraphs

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