Pages that link to "Item:Q1352094"
From MaRDI portal
The following pages link to The \((n,k)\)-star graph: A generalized star graph (Q1352094):
Displaying 50 items.
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs (Q265074) (← links)
- Fault-tolerance of \((n, k)\)-star networks (Q298504) (← links)
- \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs (Q385956) (← links)
- Strong local diagnosability of \((n,k)\)-star graphs and Cayley graphs generated by 2-trees with missing edges (Q396630) (← links)
- On the bounds of feedback numbers of \((n,k)\)-star graphs (Q436576) (← links)
- The conditional fault diagnosability of \((n, k)\)-star graphs (Q440955) (← links)
- On deriving conditional diagnosability of interconnection networks (Q456083) (← links)
- A note on path embedding in crossed cubes with faulty vertices (Q509890) (← links)
- The pessimistic diagnosability of three kinds of graphs (Q516888) (← links)
- Mutually independent Hamiltonian connectivity of \((n,k)\)-star graphs (Q659782) (← links)
- The \(g\)-good-neighbor diagnosability of \((n,k)\)-star graphs (Q730000) (← links)
- Relationship between extra edge connectivity and component edge connectivity for regular graphs (Q784476) (← links)
- Reliability analysis of the cactus-based networks (Q820572) (← links)
- Weak-vertex-pancyclicity of (\(n,k\))-star graphs (Q924149) (← links)
- Conditional fault Hamiltonicity of the complete graph (Q963413) (← links)
- One-to-many node-disjoint paths in \((n,k)\)-star graphs (Q968113) (← links)
- Distance formula and shortest paths for the \((n,k)\)-star graphs (Q975861) (← links)
- Hamiltonian connectivity of 2-tree-generated networks (Q1007659) (← links)
- On the surface area of the \((n,k)\)-star graph (Q1040590) (← links)
- Survey on path and cycle embedding in some networks (Q1042541) (← links)
- The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs (Q1627875) (← links)
- Parallel routing in regular networks with faults (Q1628698) (← links)
- A kind of conditional fault tolerance of \((n, k)\)-star graphs (Q1675782) (← links)
- On fault tolerance of \((n,k)\)-star networks (Q1680538) (← links)
- A complete classification of which \((n,k)\)-star graphs are Cayley graphs (Q1706438) (← links)
- Reliability of \((n,k)\)-star network based on \(g\)-extra conditional fault (Q1711834) (← links)
- A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks (Q1711835) (← links)
- The 2-good-neighbor (2-extra) diagnosability of alternating group graph networks under the PMC model and MM\(^*\) model (Q1735438) (← links)
- Length two path centered surface areas of the \((n, k)\)-star graph (Q1750617) (← links)
- A survey for conditional diagnosability of alternating group networks (Q2019515) (← links)
- The \(R_g\)-conditional diagnosability of international networks (Q2055969) (← links)
- Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks (Q2077379) (← links)
- A new proof for exact relationship between extra connectivity and extra diagnosability of regular connected graphs under MM* model (Q2182657) (← links)
- The 4-set tree connectivity of \((n, k)\)-star networks (Q2205941) (← links)
- Maximum independent sets partition of \((n, k)\)-star graphs (Q2325197) (← links)
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks (Q2331598) (← links)
- Strongly Menger connectedness of data center network and \((n,k)\)-star graph (Q2333811) (← links)
- On the problem of determining which \((n, k)\)-star graphs are Cayley graphs (Q2361079) (← links)
- On \(g\)-good-neighbor conditional diagnosability of \((n,k)\)-star networks (Q2405898) (← links)
- Linearly many faults in Cayley graphs generated by transposition trees (Q2456457) (← links)
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs (Q2466076) (← links)
- The non-inclusive \(g\)-good-neighbor diagnosability of interconnection networks (Q2672585) (← links)
- The number of shortest paths in the (n, k)-star graph (Q2931914) (← links)
- AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULT-TOLERANT ROUTING ON THE (n, k)-STAR GRAPH (Q2941089) (← links)
- Conditional fault-tolerant routing of (<i>n</i>,<i>k</i>)-star graphs (Q2957750) (← links)
- Matching preclusion for the (<i>n, k</i>)-bubble-sort graphs (Q3056376) (← links)
- Linearly many faults in 2-tree-generated networks (Q3057135) (← links)
- Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs (Q4640337) (← links)
- Fractional Matching Preclusion for (<i>n</i>,<i>k</i>)-Star Graphs (Q5087845) (← links)
- GENERALIZED CONNECTIVITY OF (n, k)-STAR GRAPHS (Q5168414) (← links)