On two generalized connectivities of graphs

DOI10.7151/dmgt.1987zbMath1377.05082OpenAlexW2622377038MaRDI QIDQ1692646

Peng Zhang

Publication date: 10 January 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1987

zbMATH Keywords

Cayley graphCartesian product\(k\)-connectivitypendant tree-connectivity

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (6)

On the maximum and minimum sizes of a graph with given \(k\)-connectivity ⋮ Separation of Cartesian products of graphs into several connected components by the removal of vertices ⋮ Sharp upper bounds for generalized edge-connectivity of product graphs ⋮ The reliability analysis based on the generalized connectivity in balanced hypercubes ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ Generalized 4-connectivity of hierarchical star networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp upper bounds for generalized edge-connectivity of product graphs
• Tree connectivities of Cayley graphs on abelian groups with small degrees
• On the difference of two generalized connectivities of a graph
• On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
• Pendant tree-connectivity
• Hamiltonian decomposition of Cayley graphs of degree 4
• On the \(\ell\)-connectivity of a graph
• The Steiner tree packing problem in VLSI design
• Pseudo-Cartesian products and Hamiltonian decompositions of Cayley graphs on abelian groups
• Packing Steiner trees: A cutting plane algorithm and computational results
• On the maximum and minimum sizes of a graph with given \(k\)-connectivity
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
• On the generalized (edge-)connectivity of graphs
• Generalized Connectivity of Graphs
• Rainbow trees in graphs and generalized connectivity
• A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
• A group-theoretic model for symmetric interconnection networks
• Algebraic Graph Theory
• Graphs with large generalized 3-connectivity
• The generalized 3-connectivity of Lexicographic product graphs
• Generalized 3-edge-connectivity of Cartesian product graphs
• The generalized 3-connectivity of Cartesian product graphs
• The generalized 3-connectivity of random graphs

This page was built for publication: On two generalized connectivities of graphs