Cyclic arc-connectivity in a Cartesian product digraph
From MaRDI portal
Publication:975283
DOI10.1016/J.AML.2010.03.013zbMATH Open1215.05142OpenAlexW2022319980MaRDI QIDQ975283FDOQ975283
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
Recommendations
- On cyclic vertex-connectivity of Cartesian product digraphs
- The restricted arc connectivity of Cartesian product digraphs
- Super-connected and super-arc-connected Cartesian product of digraphs
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles
- Cyclic vertex connectivity of Cartesian product cycles
Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Connectivity (05C40) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- On the extraconnectivity of graphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Restricted arc-connectivity of digraphs
- On computing a conditional edge-connectivity of a graph
- On restricted connectivities of permutation graphs
- Super connectivity of line graphs and digraphs
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- On super edge-connectivity of Cartesian product graphs
- \(\lambda ^{\prime}\)-optimal digraphs
- The restricted arc connectivity of Cartesian product digraphs
- Reliability of interconnection networks modeled by Cartesian product digraphs
- Reliability of interconnection networks modeled by a product of graphs
Cited In (7)
- 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
- On arc connectivity of direct-product digraphs
- Restricted connectivity of total digraph
- On cyclic vertex-connectivity of Cartesian product digraphs
- Arc fault tolerance of cartesian product digraphs on hyper arc connectivity
- Strong digraph groups
This page was built for publication: Cyclic arc-connectivity in a Cartesian product digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975283)
