Distance formula and shortest paths for the \((n,k)\)-star graphs
From MaRDI portal
Publication:975861
DOI10.1016/j.ins.2010.01.016zbMath1203.05042MaRDI QIDQ975861
Eddie Cheng, Zhizhang Shen, László Lipták, Jerrold W. Grossman, Ke Qiu
Publication date: 11 June 2010
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2010.01.016
Related Items
Fault-tolerance of \((n, k)\)-star networks, The number of shortest paths in the arrangement graph, The panpositionable panconnectedness of augmented cubes, Maximum independent sets partition of \((n, k)\)-star graphs, On the problem of determining which \((n, k)\)-star graphs are Cayley graphs, The number of shortest paths in the (n, k)-star graph, Conditional fault-tolerant routing of (n,k)-star graphs
Cites Work
- Unnamed Item
- Diameter, short paths and superconnectivity in digraphs
- Hyper Hamiltonian laceability on edge fault star graph
- Whitney numbers of the second kind for the star poset
- Substar reliability analysis in star networks
- Some topological properties of star graphs: The surface area and volume
- On the surface area of the \((n,k)\)-star graph
- The \((n,k)\)-star graph: A generalized star graph
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
- There is no optimal routing policy for the torus.
- Higher dimensional hexagonal networks
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- Robustness of star graph network under link failure
- Maximally connected digraphs
- TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH