Pages that link to "Item:Q4420900"
From MaRDI portal
The following pages link to Transposition networks as a class of fault-tolerant robust networks (Q4420900):
Displaying 13 items.
- VLSI layouts of complete graphs and star graphs (Q293402) (← links)
- Data center interconnection networks are not hyperbolic (Q301597) (← links)
- Edge-transitivity of Cayley graphs generated by transpositions (Q339495) (← links)
- The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks (Q479026) (← links)
- The number of shortest paths in the arrangement graph (Q497229) (← links)
- Some conditional vertex connectivities of complete-transposition graphs (Q527179) (← links)
- A kind of conditional connectivity of transposition networks generated by \(k\)-trees (Q1701105) (← links)
- A kind of conditional connectivity of Cayley graphs generated by wheel graphs (Q1735259) (← links)
- Reliability analysis of Cayley graphs generated by transpositions (Q1752593) (← links)
- On the energy of transposition graphs (Q2089558) (← links)
- Distance distribution of nodes in star graphs (Q2371054) (← links)
- The number of shortest paths in the (n, k)-star graph (Q2931914) (← links)
- Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs (Q3057177) (← links)