Tree connectivities of Cayley graphs on abelian groups with small degrees
From MaRDI portal
Publication:503543
DOI10.1007/s40840-015-0147-8zbMath1353.05062OpenAlexW758524213MaRDI QIDQ503543
Publication date: 13 January 2017
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-015-0147-8
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (13)
On the maximum and minimum sizes of a graph with given \(k\)-connectivity ⋮ Sharp upper bounds for generalized edge-connectivity of product graphs ⋮ A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ The generalized 3-connectivity of burnt pancake graphs and godan graphs ⋮ On two generalized connectivities of graphs ⋮ The 4-set tree connectivity of \((n, k)\)-star networks ⋮ The minimum size of a graph with given tree connectivity ⋮ The generalized 3-connectivity of graph products ⋮ On the difference of two generalized connectivities of a graph ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs ⋮ Two lower bounds for generalized 3-connectivity of Cartesian product graphs ⋮ Extremal results for directed tree connectivity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On extremal graphs with internally disjoint Steiner trees
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
- Pendant tree-connectivity
- Hamiltonian decomposition of Cayley graphs of degree 4
- Pseudo-Cartesian products and Hamiltonian decompositions of Cayley graphs on abelian groups
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- The generalized connectivity of complete equipartition 3-partite graphs
- Note on the spanning-tree packing number of lexicographic product graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
- On the generalized (edge-)connectivity of graphs
- Rainbow trees in graphs and generalized connectivity
- Circulants and their connectivities
- A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
- A group-theoretic model for symmetric interconnection networks
- Modeling Toroidal Networks with the Gaussian Integers
- The generalized 3-connectivity of Lexicographic product graphs
- Generalized 3-edge-connectivity of Cartesian product graphs
- FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
- The generalized 3-connectivity of Cartesian product graphs
This page was built for publication: Tree connectivities of Cayley graphs on abelian groups with small degrees