THE Qn,k,m GRAPH: A COMMON GENERALIZATION OF VARIOUS POPULAR INTERCONNECTION NETWORKS
From MaRDI portal
Publication:5408362
DOI10.1142/S0129626413500114zbMath1284.68040MaRDI QIDQ5408362
Publication date: 10 April 2014
Published in: Parallel Processing Letters (Search for Journal in Brave)
Cayley graphsconnectivityinterconnection networksarrangement graphs\((n, k)\)-star graphsgeneration algorithm
Umbral calculus (05A40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)
Related Items (2)
Reliability analysis of the cactus-based networks ⋮ A Note of Independent Number and Domination Number of Qn,k,m-Graph
Cites Work
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Hamiltonian laceability of bubble-sort graphs with edge faults
- Orienting Cayley graphs generated by transposition trees
- Bipancyclic properties of Cayley graphs generated by transpositions
- Arrangement graphs: A class of generalized star graphs
- The \((n,k)\)-star graph: A generalized star graph
- Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets
- FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- Hyper hamiltonian laceability of Cayley graphs generated by transpositions
- TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH
This page was built for publication: THE Qn,k,m GRAPH: A COMMON GENERALIZATION OF VARIOUS POPULAR INTERCONNECTION NETWORKS