Super-connected and super-arc-connected Cartesian product of digraphs

DOI10.1016/j.ipl.2008.04.006zbMath1189.05151OpenAlexW2055481461MaRDI QIDQ975411

Juan Liu, Ji Xiang Meng

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.04.006

zbMATH Keywords

combinatorial problemssuper-connectedCartesian product of digraphssuper-arc-connected

Mathematics Subject Classification ID

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

Related Items (6)

Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity ⋮ Arc fault tolerance of cartesian product digraphs on hyper arc connectivity ⋮ Edge fault tolerance of super edge connectivity for three families of interconnection networks ⋮ Double-super-connected digraphs ⋮ Super restricted edge connected Cartesian product graphs ⋮ Super connectivity of Kronecker products of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Connectivity of Cartesian product graphs
• Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes
• On connectivity of the cartesian product of two graphs
• Graphs with Given Group and Given Graph-Theoretical Properties
• On super edge-connectivity of Cartesian product graphs
• Reliability of interconnection networks modeled by Cartesian product digraphs
• Super edge- and point-connectivities of the Cartesian product of regular graphs

This page was built for publication: Super-connected and super-arc-connected Cartesian product of digraphs