scientific article; zbMATH DE number 2230273
From MaRDI portal
Publication:5708565
zbMath1075.68529MaRDI QIDQ5708565
Publication date: 18 November 2005
Full work available at URL: http://www.sciencedirect.com/science/journal/15710653
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs
- VLSI layouts of complete graphs and star graphs
- On the Day-Tripathi orientation of the star graphs: connectivity
- Recognizing tough graphs is NP-hard
- Arrangement graphs: A class of generalized star graphs
- Separating from the dominant of the spanning tree polytope
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Unidirectional star graphs
- The 4-star graph is not a subgraph of any hypercube
- Edge-integrity: A survey
- A faster algorithm for computing the strength of a network
- The \((n,k)\)-star graph: A generalized star graph
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
- Vertex-symmetric digraphs with small diameter
- Connectivity and edge-disjoint spanning trees
- Fault tolerant routing in the star and pancake interconnection networks
- On the existence of certain disjoint arcs in graphs
- Tough graphs and Hamiltonian circuits.
- On the arrangement graph.
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Optimal attack and reinforcement of a network
- Fault Diagnosis in a Boolean n Cube Array of Microprocessors
- On the Computational Complexity of Combinatorial Problems
- The Indirect Binary n-Cube Microprocessor Array
- Congestion-free, dilation-2 embedding of complete binary trees into star graphs
- A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs
- Cluster fault-tolerant routing in star graphs
- A new class of interconnection networks based on the alternating group
- Embedding of cycles in arrangement graphs
This page was built for publication:
