Cyclic vertex connectivity of Cartesian product graphs

DOI10.16205/J.CNKI.CAMA.2016.0015MaRDI QIDQ3180004zbMATH OpenFDO

Authors Laihuan Chen, Yingzhi Tian, Jixiang Meng

Publication date 6 January 2017

Full work available at URL https://doi.org/10.16205/J.CNKI.CAMA.2016.0015

zbMATH Keywords

Cartesian productconnectivitycyclic vertex connectivityperfect matching

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Cyclic vertex connectivity of Cartesian product cycles
• On cyclic vertex-connectivity of Cartesian product digraphs
• On conditional connectivity of the Cartesian product of cycles
• On k-restricted connectivity of direct product of graphs
• Connectivity of Cartesian product graphs

Cited in

(4)

• On cyclic vertex-connectivity of Cartesian product digraphs
• On conditional connectivity of the Cartesian product of cycles
• Cyclic vertex connectivity of Cartesian product cycles
• Cyclic edge and cyclic vertex connectivity of (4, 5, 6)-fullerene graphs

This page was built for publication: Cyclic vertex connectivity of Cartesian product graphs

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