Cyclic arc-connectivity in a Cartesian product digraph
From MaRDI portal
Publication:975283
DOI10.1016/j.aml.2010.03.013zbMath1215.05142OpenAlexW2022319980MaRDI QIDQ975283
Publication date: 9 June 2010
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2010.03.013
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (5)
The number of spanning trees in a new lexicographic product of graphs ⋮ Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity ⋮ Restricted connectivity of total digraph ⋮ Arc fault tolerance of cartesian product digraphs on hyper arc connectivity ⋮ On cyclic vertex-connectivity of Cartesian product digraphs
Cites Work
- Unnamed Item
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- \(\lambda ^{\prime}\)-optimal digraphs
- The restricted arc connectivity of Cartesian product digraphs
- On computing a conditional edge-connectivity of a graph
- On the extraconnectivity of graphs
- Restricted arc-connectivity of digraphs
- Super connectivity of line graphs and digraphs
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- Reliability of interconnection networks modeled by a product of graphs
- On super edge-connectivity of Cartesian product graphs
- Reliability of interconnection networks modeled by Cartesian product digraphs
- On restricted connectivities of permutation graphs
This page was built for publication: Cyclic arc-connectivity in a Cartesian product digraph
