Random induced subgraphs of Cayley graphs induced by transpositions
From MaRDI portal
Publication:409364
DOI10.1016/j.disc.2011.07.027zbMath1239.05089arXiv0909.4037OpenAlexW2051144681MaRDI QIDQ409364
Emma Yu Jin, Christian M. Reidys
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0909.4037
Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding longest fault-free paths onto star graphs with more vertex faults
- Hyper Hamiltonian laceability on edge fault star graph
- Minimal factorizations of permutations into star transpositions
- Large components in random induced subgraphs of \(n\)-cubes
- Limiting behavior for the distance of a random walk
- Strong uniform times and finite random walks
- Largest random component of a k-cube
- On the fault-diameter of the star graph
- Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees
- Estimating the expected reversal distance after a fixed number of reversals
- A phase transition in the random transposition random walk
- Reliable Broadcasting in Hypercubes with Random Link and Node Failures
- Transforming cabbage into turnip
- Hyper hamiltonian laceability of Cayley graphs generated by transpositions
- A group-theoretic model for symmetric interconnection networks
- The Evolution of Random Subgraphs of the Cube
- Hamiltonian-laceability of star graphs
- Estimating true evolutionary distances between genomes
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Longest fault-free paths in star graphs with vertex faults
This page was built for publication: Random induced subgraphs of Cayley graphs induced by transpositions
