TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH
From MaRDI portal
Publication:5248977
DOI10.1142/S0129054198000167zbMath1319.68016OpenAlexW1999761254MaRDI QIDQ5248977
Rong-Jaye Chen, Wei-Kuo Chiang
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054198000167
Network design and communication in computer systems (68M10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (16)
THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS ⋮ Fault-tolerance of \((n, k)\)-star networks ⋮ AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULT-TOLERANT ROUTING ON THE (n, k)-STAR GRAPH ⋮ A kind of conditional fault tolerance of \((n, k)\)-star graphs ⋮ \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs ⋮ Cayley graphs of groupoids and generalized fat-trees ⋮ The stochastic pseudo-star degree centrality problem ⋮ Conditional fault-tolerant routing of (n,k)-star graphs ⋮ The 4-set tree connectivity of \((n, k)\)-star networks ⋮ The conditional fault diagnosability of \((n, k)\)-star graphs ⋮ Weak-vertex-pancyclicity of (\(n,k\))-star graphs ⋮ Constructing vertex-disjoint paths in \((n, k)\)-star graphs ⋮ THE Qn,k,m GRAPH: A COMMON GENERALIZATION OF VARIOUS POPULAR INTERCONNECTION NETWORKS ⋮ One-to-many node-disjoint paths in \((n,k)\)-star graphs ⋮ Distance formula and shortest paths for the \((n,k)\)-star graphs ⋮ Maximum independent sets partition of \((n, k)\)-star graphs
Cites Work
This page was built for publication: TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH
