Two lower bounds for generalized 3-connectivity of Cartesian product graphs

DOI10.1016/j.amc.2018.04.007zbMath1427.05188arXiv1705.08087OpenAlexW2617982196WikidataQ129643165 ScholiaQ129643165MaRDI QIDQ2335758

Kaishun Wang, Benjian Lv, Hui Gao

Publication date: 15 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.08087

zbMATH Keywords

connectivityCartesian productgeneralized connectivity

Mathematics Subject Classification ID

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

Related Items (1)

The generalized 4-connectivity of locally twisted cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Tree connectivities of Cayley graphs on abelian groups with small degrees
• The generalized 3-connectivity of star graphs and bubble-sort graphs
• Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
• The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
• The generalized 3-connectivity of graph products
• Note on the hardness of generalized connectivity
• On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
• The generalized connectivity of complete equipartition 3-partite graphs
• On the generalized (edge-)connectivity of graphs
• Generalized Connectivity of Graphs
• Rainbow trees in graphs and generalized connectivity
• The minimal size of a graph with generalized connectivity $\kappa_3 = 2$
• The generalized connectivity of complete bipartite graphs
• The generalized 3-connectivity of Lexicographic product graphs
• The generalized 3-connectivity of Cartesian product graphs

This page was built for publication: Two lower bounds for generalized 3-connectivity of Cartesian product graphs