The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
type: Item
instance of: scholarly article
title: The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
zbMATH Open document ID: 1428.05168
author: Hengzhe Li
author: Jiajia Wang
published in: Applied Mathematics and Computation
publication date: 2019-11-22T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C76
zbMATH DE Number: 7135014
zbMATH Keywords: recursive circulant
zbMATH Keywords: \( \lambda_3\)-connectivity
zbMATH Keywords: \( \kappa_3\)-edge-connectivity
MaRDI profile type: Publication
full work available at URL: j.amc.2018.07.065
OpenAlex ID: W2888399706
cites work: Q5422499
cites work: Rainbow trees in graphs and generalized connectivity
cites work: Hamiltonian decomposition of generalized recursive circulant graphs
cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
cites work: A mixed version of Menger's theorem
cites work: Mixed connectivity of random graphs
cites work: Pendant tree-connectivity
cites work: Q4386304
cites work: The generalized 3-connectivity of Cartesian product graphs
cites work: The generalized 3-connectivity of graph products
cites work: Steiner tree packing number and tree connectivity
cites work: Note on the hardness of generalized connectivity
cites work: On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
cites work: Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
cites work: The generalized 3-connectivity of star graphs and bubble-sort graphs
cites work: The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs
cites work: The generalized 3-connectivity of Lexicographic product graphs
cites work: On the generalized (edge-)connectivity of graphs
cites work: Generalized Connectivity of Graphs
cites work: Disjoint Hamiltonian cycles in recursive circulant graphs
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Recursive circulants and their embeddings among hypercubes
cites work: Q4257150
cites work: Sharp upper bounds for generalized edge-connectivity of product graphs
cites work: On two generalized connectivities of graphs
cites work: A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
cites work: On the difference of two generalized connectivities of a graph
cites work: Tree connectivities of Cayley graphs on abelian groups with small degrees
cites work: On the Problem of Decomposing a Graph into n Connected Factors
DOI: 10.1016/J.AMC.2018.07.065
description: scientific article; zbMATH DE number 7135014