Pages that link to "Item:Q975861"
From MaRDI portal
The following pages link to Distance formula and shortest paths for the \((n,k)\)-star graphs (Q975861):
Displayed 7 items.
- Fault-tolerance of \((n, k)\)-star networks (Q298504) (← links)
- The number of shortest paths in the arrangement graph (Q497229) (← links)
- The panpositionable panconnectedness of augmented cubes (Q991906) (← links)
- Maximum independent sets partition of \((n, k)\)-star graphs (Q2325197) (← links)
- On the problem of determining which \((n, k)\)-star graphs are Cayley graphs (Q2361079) (← links)
- The number of shortest paths in the (n, k)-star graph (Q2931914) (← links)
- Conditional fault-tolerant routing of (<i>n</i>,<i>k</i>)-star graphs (Q2957750) (← links)