The super restricted edge-connectedness of direct product graphs

DOI10.1142/S0129626423500081MaRDI QIDQ6535155zbMATH OpenFDO

Authors Minglu Bai, Yingzhi Tian, J. Yin

Publication date 10 November 2023

Published in Parallel Processing Letters (Search for Journal in Brave)

zbMATH Keywords

direct productedge-connectivityrestricted edge-connectivitysuper-restricted edge-connectedness

Mathematics Subject Classification ID

Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Super edge connectivity of direct product of graphs.
• Super restricted edge connected Cartesian product graphs
• The \(k\)-restricted edge-connectivity of a product of graphs
• On restricted edge-connectivity of lexicographic product graphs
• On k-restricted connectivity of direct product of graphs

Cites work

• A characterization of the edge connectivity of direct products of graphs
• Conditional connectivity
• On computing a conditional edge-connectivity of a graph
• On edge connectivity of direct products of graphs
• On the connectivity of the direct product of graphs
• The Kronecker Product of Graphs
• The restricted edge-connectivity of Kronecker product graphs

Cited in

(1)

• Super edge- and point-connectivities of the Cartesian product of regular graphs

This page was built for publication: The super restricted edge-connectedness of direct product graphs

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