Edge isoperimetric method: at least 2 / 3 of h-extra edge-connectivity of a kind of cube-based graphs concentrates on 2ⁿ - 1

DOI10.1016/J.DAM.2025.03.019MaRDI QIDQ6992273zbMATH OpenFDO

Authors Mingzu Zhang, Chia-Wei Lee, Weihua Yang

Publication date 28 April 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.03.019

zbMATH Keywords

concentration phenomenonconnectivityedge isoperimetric methodperfect matching

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A note on the edges of the n-cube
• Assignment of Numbers to Vertices
• Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
• Conditional connectivity
• Connectivity and super connectivity of folded hypercube-like networks
• Fault tolerance assessment for Hamming graphs based on r-restricted R-structure(substructure) fault pattern
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Many-to-many edge-disjoint paths in (n,k)-enhanced hypercube under three link-faulty hypotheses
• Maximally Connected Arrays on the n-Cube
• On restricted edge-connectivity of graphs.
• On the extraconnectivity of graphs
• Optimal Assignments of Numbers to Vertices
• Optimal numberings and isoperimetric problems on graphs
• Sufficient conditions for restricted-edge-connectivity to be optimal
• The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
• The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\)
• The vertex-isoperimetric number of the incidence and non-incidence graphs of unitals
• Torus-like graphs and their paired many-to-many disjoint path covers
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements

Cited in

(1)

• Concentration phenomenon of h-extra edge-connectivity in the n-th Cartesian product of K₉ - C₉ with large-scale faulty links

This page was built for publication: Edge isoperimetric method: at least \(2 / 3\) of \(h\)-extra edge-connectivity of a kind of cube-based graphs concentrates on \(2^{n - 1}\)

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