scientific article; zbMATH DE number 2230273
From MaRDI portal
Publication:5708565
Cites work
- A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs
- A faster algorithm for computing the strength of a network
- A new class of interconnection networks based on the alternating group
- An efficient algorithm for k-pairwise disjoint paths in star graphs
- Arrangement graphs: A class of generalized star graphs
- Cluster fault-tolerant routing in star graphs
- Congestion-free, dilation-2 embedding of complete binary trees into star graphs
- Connectivity and edge-disjoint spanning trees
- Edge-Disjoint Spanning Trees of Finite Graphs
- Edge-integrity: A survey
- Embedding of cycles in arrangement graphs
- Fault Diagnosis in a Boolean n Cube Array of Microprocessors
- Fault tolerant routing in the star and pancake interconnection networks
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- scientific article; zbMATH DE number 4043858 (Why is no real title available?)
- scientific article; zbMATH DE number 4085694 (Why is no real title available?)
- scientific article; zbMATH DE number 1185932 (Why is no real title available?)
- scientific article; zbMATH DE number 3735859 (Why is no real title available?)
- scientific article; zbMATH DE number 653234 (Why is no real title available?)
- scientific article; zbMATH DE number 1769329 (Why is no real title available?)
- scientific article; zbMATH DE number 861347 (Why is no real title available?)
- scientific article; zbMATH DE number 1439419 (Why is no real title available?)
- scientific article; zbMATH DE number 1439471 (Why is no real title available?)
- scientific article; zbMATH DE number 1444282 (Why is no real title available?)
- scientific article; zbMATH DE number 2187684 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Increasing the connectivity of split-stars
- On the arrangement graph.
- On the Computational Complexity of Combinatorial Problems
- On the Day-Tripathi orientation of the star graphs: connectivity
- On the existence of certain disjoint arcs in graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Optimal attack and reinforcement of a network
- Orienting the arrangement graphs
- Recognizing tough graphs is NP-hard
- Separating from the dominant of the spanning tree polytope
- The 4-star graph is not a subgraph of any hypercube
- The (n,k)-star graph: A generalized star graph
- The Indirect Binary n-Cube Microprocessor Array
- Tough graphs and Hamiltonian circuits.
- Unidirectional star graphs
- Vertex-symmetric digraphs with small diameter
- VLSI layouts of complete graphs and star graphs
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5708565)
