Reliability of interconnection networks modeled by Cartesian product digraphs

DOI10.1002/NET.20231MaRDI QIDQ3548720zbMATH OpenOpenAlexFDO

Authors Chao Yang, Jun-Ming Xu

Publication date 17 December 2008

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20231

zbMATH Keywords

connectivityedge-connectivityCartesian product digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Reliability, availability, maintenance, inspection in operations research (90B25) Communication networks in operations research (90B18)

Recommendations

• Connectivity of Cartesian product graphs
• Reliability of interconnection networks modeled by a product of graphs
• Connectivity of Cartesian products of graphs
• The restricted arc connectivity of Cartesian product digraphs
• The reliability of lexicographic product digraphs

Cites work

• scientific article; zbMATH DE number 4110724 (Why is no real title available?)
• Connectivity and super-connectivity of Cartesian product graphs.
• Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes
• Connectivity of Cartesian product graphs
• Distance and connectivity measures in permutation graphs
• Graphs with Given Group and Given Graph-Theoretical Properties
• On connectivity of the cartesian product of two graphs
• On restricted connectivities of permutation graphs
• Reliability of interconnection networks modeled by a product of graphs
• Theory and Application of Graphs

Cited in

(14)

• Network reliability: Heading out on the highway
• Graph theoretic characterization and reliability of the multiple-clique network
• Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity
• Connectivity of Cartesian product graphs
• The restricted edge-connectivity of Kronecker product graphs
• Separation of Cartesian products of graphs into several connected components by the removal of vertices
• The reliability of lexicographic product digraphs
• Cyclic arc-connectivity in a Cartesian product digraph
• Super-connected and super-arc-connected Cartesian product of digraphs
• The Menger number of the Cartesian product of graphs
• Arc fault tolerance of Cartesian product digraphs on hyper arc connectivity
• Approximation of functions of large matrices with Kronecker structure
• Reliability of interconnection networks modeled by a product of graphs
• On edge connectivity of direct products of graphs

This page was built for publication: Reliability of interconnection networks modeled by Cartesian product digraphs

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