Pages that link to "Item:Q3835424"
From MaRDI portal
The following pages link to A group-theoretic model for symmetric interconnection networks (Q3835424):
Displaying 50 items.
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs (Q265074) (← links)
- The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) model (Q266281) (← links)
- Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution (Q281902) (← links)
- Node-to-set disjoint paths problem in star graphs (Q287065) (← links)
- Minimal sense of direction in regular networks (Q290224) (← links)
- An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs (Q293380) (← links)
- Pruned three-dimensional toroidal networks (Q293439) (← links)
- Cyclic-cubes and wrap-around butterflies (Q294788) (← links)
- Fault-tolerance of \((n, k)\)-star networks (Q298504) (← links)
- Data center interconnection networks are not hyperbolic (Q301597) (← links)
- Embedded connectivity of recursive networks (Q329723) (← links)
- Edge-transitivity of Cayley graphs generated by transpositions (Q339495) (← links)
- Flipping triangles and rectangles (Q386439) (← links)
- Conditional diagnosability of arrangement graphs under the PMC model (Q401482) (← links)
- Random induced subgraphs of Cayley graphs induced by transpositions (Q409364) (← links)
- Resistance distances and the Kirchhoff index in Cayley graphs (Q411847) (← links)
- Edge fault tolerance of graphs with respect to super edge connectivity (Q412367) (← links)
- Automorphism groups of the Pancake graphs (Q413293) (← links)
- Gossiping and routing in second-kind Frobenius graphs (Q427787) (← links)
- The conditional fault diagnosability of \((n, k)\)-star graphs (Q440955) (← links)
- The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks (Q479026) (← links)
- Hamiltonian cycles in unitary prefix transposition rearrangement graphs (Q491601) (← links)
- Pancake flipping is hard (Q494050) (← links)
- The number of shortest paths in the arrangement graph (Q497229) (← links)
- Fault diagnosability of arrangement graphs (Q497286) (← links)
- Tighter upper bound for sorting permutations with prefix transpositions (Q497672) (← links)
- Tree connectivities of Cayley graphs on abelian groups with small degrees (Q503543) (← links)
- Conditional connectivity of recursive interconnection networks respect to embedding restriction (Q506317) (← links)
- Estimating the subsystem reliability of bubblesort networks (Q515547) (← links)
- The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks (Q516905) (← links)
- The distance spectra of Cayley graphs of Coxeter groups (Q533786) (← links)
- Embedding longest fault-free paths onto star graphs with more vertex faults (Q557839) (← links)
- The super connectivity of the pancake graphs and the super laceability of the star graphs (Q557901) (← links)
- Labelings in Cayley digraphs (Q607377) (← links)
- Edge-bipancyclicity of star graphs with faulty elements (Q650935) (← links)
- Some results on the lexicographic product of vertex-transitive graphs (Q654220) (← links)
- Conditional diagnosability of alternating group networks (Q656588) (← links)
- Mutually independent Hamiltonian connectivity of \((n,k)\)-star graphs (Q659782) (← links)
- Echo: a peer-to-peer clustering framework for improving communication in DHTs (Q666026) (← links)
- Shortest routing in trivalent Cayley graph network (Q672093) (← links)
- Trivalent Cayley graphs for interconnection networks (Q672973) (← links)
- The influence of graph structure on generalized dimension exchange (Q672977) (← links)
- Hamilton cycles in Trivalent Cayley graphs (Q673339) (← links)
- Hyper Hamiltonian laceability on edge fault star graph (Q707305) (← links)
- Conditional connectivity of star graph networks under embedding restriction (Q712688) (← links)
- A general technique to establish the asymptotic conditional diagnosability of interconnection networks (Q714794) (← links)
- Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes (Q726167) (← links)
- A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges (Q732323) (← links)
- Rotational circulant graphs (Q741752) (← links)
- Fault tolerance in bubble-sort graph networks (Q764377) (← links)
