A concentration phenomenon for $h$-extra edge-connectivity reliability analysis of enhanced hypercubes $Q_{n,2}$ with exponentially many faulty links
Fuente:
arXiv
Guardado en:
| Autores principales: | Sun, Yali, Zhang, Mingzu, Feng, Xing, Yang, Xing |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
por: Bastida, Sam, et al.
Publicado: (2026)
por: Bastida, Sam, et al.
Publicado: (2026)
On the number of partitions of the hypercube ${\bf Z}_q^n$ into large subcubes
por: Tarannikov, Yuriy
Publicado: (2024)
por: Tarannikov, Yuriy
Publicado: (2024)
Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
por: Spirkl, Sophie, et al.
Publicado: (2026)
por: Spirkl, Sophie, et al.
Publicado: (2026)
On the edge expansion of random polytopes
por: Ferber, Asaf, et al.
Publicado: (2025)
por: Ferber, Asaf, et al.
Publicado: (2025)
An upper bound on the number of frequency hypercubes
por: Krotov, Denis S., et al.
Publicado: (2022)
por: Krotov, Denis S., et al.
Publicado: (2022)
ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G$^2$-connected medians
por: Bénéteau, Laurine, et al.
Publicado: (2022)
por: Bénéteau, Laurine, et al.
Publicado: (2022)
Restricted subgraphs of edge-colored graphs and applications
por: Sudakov, Benny
Publicado: (2024)
por: Sudakov, Benny
Publicado: (2024)
Multigraph edge-coloring with local list sizes
por: Dhawan, Abhishek
Publicado: (2023)
por: Dhawan, Abhishek
Publicado: (2023)
Vertex-edge domination on subclasses of bipartite graphs
por: Pandey, Arti, et al.
Publicado: (2025)
por: Pandey, Arti, et al.
Publicado: (2025)
On the expressive power of $2$-edge-colourings of graphs
por: Bok, Jan, et al.
Publicado: (2025)
por: Bok, Jan, et al.
Publicado: (2025)
Neighbour sum distinguishing edge-weightings with local constraints
por: Dailly, Antoine, et al.
Publicado: (2022)
por: Dailly, Antoine, et al.
Publicado: (2022)
A hierarchy of edge-weight symmetries in perfect matchings
por: Bérczi, Kristóf, et al.
Publicado: (2026)
por: Bérczi, Kristóf, et al.
Publicado: (2026)
Hamiltonian connectivity of some base-cobase graphs
por: Martínez-Sandoval, Leonardo, et al.
Publicado: (2025)
por: Martínez-Sandoval, Leonardo, et al.
Publicado: (2025)
Separating the edges of a graph by cycles and by subdivisions of $K_4$
por: Botler, Fábio, et al.
Publicado: (2024)
por: Botler, Fábio, et al.
Publicado: (2024)
Filling some gaps on the edge coloring problem of split graphs
por: Couto, Fernanda, et al.
Publicado: (2024)
por: Couto, Fernanda, et al.
Publicado: (2024)
A verified implementation of the Misra and Gries edge coloring algorithm
por: Bhoja, Arohee
Publicado: (2025)
por: Bhoja, Arohee
Publicado: (2025)
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
por: Foucaud, Florent, et al.
Publicado: (2024)
por: Foucaud, Florent, et al.
Publicado: (2024)
Minimum stationary values of sparse random directed graphs
por: Cai, Xing Shi, et al.
Publicado: (2020)
por: Cai, Xing Shi, et al.
Publicado: (2020)
A Vizing-like theorem for union vertex-distinguishing edge coloring
por: Bousquet, Nicolas, et al.
Publicado: (2016)
por: Bousquet, Nicolas, et al.
Publicado: (2016)
Increasing arc-connectivity by bounded- and fixed-size inversions
por: Hörsch, Florian, et al.
Publicado: (2026)
por: Hörsch, Florian, et al.
Publicado: (2026)
Decoupling of clusters in independent sets in a percolated hypercube
por: Chowdhury, Mriganka Basu Roy, et al.
Publicado: (2025)
por: Chowdhury, Mriganka Basu Roy, et al.
Publicado: (2025)
A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
por: Baste, Julien, et al.
Publicado: (2025)
por: Baste, Julien, et al.
Publicado: (2025)
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
por: Foucaud, Florent, et al.
Publicado: (2025)
por: Foucaud, Florent, et al.
Publicado: (2025)
A bound for the cops and robber problem in terms of 2-component order connectivity
por: Jain, Suryaansh, et al.
Publicado: (2024)
por: Jain, Suryaansh, et al.
Publicado: (2024)
Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
por: Dailly, Antoine, et al.
Publicado: (2025)
por: Dailly, Antoine, et al.
Publicado: (2025)
Gaussian to log-normal transition for independent sets in a percolated hypercube
por: Chowdhury, Mriganka Basu Roy, et al.
Publicado: (2024)
por: Chowdhury, Mriganka Basu Roy, et al.
Publicado: (2024)
Substitution discrete plane tilings with $2n$-fold rotational symmetry for odd n
por: Kari, Jarkko, et al.
Publicado: (2020)
por: Kari, Jarkko, et al.
Publicado: (2020)
Trees and co-trees in planar 3-connected graphs An easier proof via Schnyder woods
por: Ortlieb, Christian, et al.
Publicado: (2024)
por: Ortlieb, Christian, et al.
Publicado: (2024)
Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n>24
por: Pierre, Laurent
Publicado: (2016)
por: Pierre, Laurent
Publicado: (2016)
Large planar $(n,m)$-cliques
por: Bandopadhyay, Susobhan, et al.
Publicado: (2024)
por: Bandopadhyay, Susobhan, et al.
Publicado: (2024)
The Graph Coloring Game on $4\times n$-Grids
por: Brosse, Caroline, et al.
Publicado: (2024)
por: Brosse, Caroline, et al.
Publicado: (2024)
The exact value of $c_1(K_{2,n})$
por: Mori, Hiroaki
Publicado: (2026)
por: Mori, Hiroaki
Publicado: (2026)
Homomorphisms of (n,m)-graphs with respect to generalised switch
por: Sen, Sagnik, et al.
Publicado: (2022)
por: Sen, Sagnik, et al.
Publicado: (2022)
On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
por: Das, Sandip, et al.
Publicado: (2023)
por: Das, Sandip, et al.
Publicado: (2023)
Effective Bounds for Restricted $3$-Arithmetic Progressions in $\mathbb{F}_p^n$
por: Bhangale, Amey, et al.
Publicado: (2023)
por: Bhangale, Amey, et al.
Publicado: (2023)
A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
por: Kupavskii, Andrey, et al.
Publicado: (2025)
por: Kupavskii, Andrey, et al.
Publicado: (2025)
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds
por: Frieze, Alan, et al.
Publicado: (2023)
por: Frieze, Alan, et al.
Publicado: (2023)
New bounds for proper $h$-conflict-free colourings
por: Chuet, Quentin, et al.
Publicado: (2025)
por: Chuet, Quentin, et al.
Publicado: (2025)
Planar Rosa : a family of quasiperiodic substitution discrete plane tilings with $2n$-fold rotational symmetry
por: Kari, Jarkko, et al.
Publicado: (2022)
por: Kari, Jarkko, et al.
Publicado: (2022)
An unconditional lower bound for the active-set method on the hypercube
por: Disser, Yann, et al.
Publicado: (2025)
por: Disser, Yann, et al.
Publicado: (2025)
Ejemplares similares
-
A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
por: Bastida, Sam, et al.
Publicado: (2026) -
On the number of partitions of the hypercube ${\bf Z}_q^n$ into large subcubes
por: Tarannikov, Yuriy
Publicado: (2024) -
Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
por: Spirkl, Sophie, et al.
Publicado: (2026) -
On the edge expansion of random polytopes
por: Ferber, Asaf, et al.
Publicado: (2025) -
An upper bound on the number of frequency hypercubes
por: Krotov, Denis S., et al.
Publicado: (2022)