Pages that link to "Item:Q1198068"
From MaRDI portal
The following pages link to Arrangement graphs: A class of generalized star graphs (Q1198068):
Displaying 50 items.
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs (Q265074) (← links)
- Conditional diagnosability of arrangement graphs under the PMC model (Q401482) (← links)
- The number of shortest paths in the arrangement graph (Q497229) (← links)
- Fault diagnosability of arrangement graphs (Q497286) (← links)
- Edge-fault-tolerant pancyclicity of arrangement graphs (Q508679) (← links)
- The pessimistic diagnosability of three kinds of graphs (Q516888) (← links)
- Conditional matching preclusion for the arrangement graphs (Q653318) (← links)
- Trivalent Cayley graphs for interconnection networks (Q672973) (← links)
- Largest independent sets of certain regular subgraphs of the derangement graph (Q737973) (← links)
- Combinatorial analysis of the subsystem reliability of the split-star network (Q778418) (← links)
- Reliability analysis of the cactus-based networks (Q820572) (← links)
- Hamiltonicity and colorings of arrangement graphs (Q860408) (← links)
- The smallest eigenvalues of the 1-point fixing graph (Q905733) (← links)
- Conditional fault Hamiltonicity of the complete graph (Q963413) (← links)
- The independence number for de Bruijn networks and Kautz networks (Q1005248) (← links)
- Constructing edge-disjoint spanning trees in locally twisted cubes (Q1006074) (← links)
- Hamiltonian connectivity of 2-tree-generated networks (Q1007659) (← links)
- Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs) (Q1027703) (← links)
- Survey on path and cycle embedding in some networks (Q1042541) (← links)
- Determining the Hamilton-connectedness of certain vertex-transitive graphs (Q1336694) (← links)
- The \((n,k)\)-star graph: A generalized star graph (Q1352094) (← links)
- Parallel routing in regular networks with faults (Q1628698) (← links)
- The spectrum of eigenvalues for certain subgraphs of the \(k\)-point fixing graph (Q1698586) (← links)
- A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks (Q1711835) (← links)
- On the reliability of alternating group graph-based networks (Q1749479) (← links)
- Length two path centered surface areas of the \((n, k)\)-star graph (Q1750617) (← links)
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey (Q1923505) (← links)
- The paths embedding of the arrangement graphs with prescribed vertices in given position (Q1928512) (← links)
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans (Q1944166) (← links)
- Conditional fault tolerance of arrangement graphs (Q1944196) (← links)
- Fault-tolerant strong Menger (edge) connectivity of arrangement graph (Q2004075) (← links)
- The spectra of arrangement graphs (Q2013201) (← links)
- Note on reliability evaluation of arrangement graphs (Q2073121) (← links)
- Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks (Q2077379) (← links)
- Structure fault-tolerance of arrangement graphs (Q2185404) (← links)
- The structure fault tolerance of arrangement graphs (Q2242673) (← links)
- Cayley graph on symmetric group generated by elements fixing \(k\) points (Q2261552) (← links)
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks (Q2331598) (← links)
- Fractional matching preclusion for arrangement graphs (Q2334054) (← links)
- On the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph (Q2357222) (← links)
- Panpositionable hamiltonicity and panconnectivity of the arrangement graphs (Q2425998) (← links)
- The edge-centered surface area of the arrangement graph (Q2436660) (← links)
- On the eigenvalues of certain Cayley graphs and arrangement graphs (Q2442263) (← links)
- Fault tolerance in the arrangement graphs (Q2446107) (← links)
- Linearly many faults in Cayley graphs generated by transposition trees (Q2456457) (← links)
- Shaped lattice graphs as models of the multiprocessor computer systems (Q2487565) (← links)
- On the arrangement graph. (Q2583567) (← links)
- Constructing edge-disjoint spanning trees in twisted cubes (Q2638205) (← links)
- THE PERMUTATIONAL GRAPH: A NEW NETWORK TOPOLOGY (Q2703011) (← links)
- Embedding longest fault-free paths in arrangement graphs with faulty vertices (Q2714908) (← links)