On cyclic vertex-connectivity of Cartesian product digraphs

DOI10.1007/S10878-011-9395-1MaRDI QIDQ1928516zbMATH OpenOpenAlexFDO

Authors Da Huang, Zhao Zhang

Publication date 3 January 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-011-9395-1

zbMATH Keywords

Cartesian product digraphcyclic vertex-connectivity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Cyclic arc-connectivity in a Cartesian product digraph
• Cyclic vertex connectivity of Cartesian product graphs
• Cyclic vertex connectivity of Cartesian product cycles
• The restricted arc connectivity of Cartesian product digraphs
• Connectivity of Cartesian product graphs

Cites work

• Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes
• Cyclic arc-connectivity in a Cartesian product digraph
• Restricted connectivity of line digraphs

Cited in

(8)

• Feedback arc number and feedback vertex number of Cartesian product of directed cycles
• Augmenting weighted graphs to establish directed point-to-point connectivity
• Restricted connectivity of total digraph
• Cyclic vertex connectivity of Cartesian product graphs
• Cyclic vertex connectivity of Cartesian product cycles
• scientific article; zbMATH DE number 6264095 (Why is no real title available?)
• Cyclic edge and cyclic vertex connectivity of (4, 5, 6)-fullerene graphs
• Cyclic arc-connectivity in a Cartesian product digraph

This page was built for publication: On cyclic vertex-connectivity of Cartesian product digraphs

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