Embedding longest fault-free paths in arrangement graphs with faulty vertices (Q2714908): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| label / en | label / en | ||
Embedding longest fault-free paths in arrangement graphs with faulty vertices | |||
| Property / cites work | |||
| Property / cites work: A group-theoretic model for symmetric interconnection networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Existence of Hamiltonian Circuits in Faulty Hypercubes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Arrangement graphs: A class of generalized star graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4002466 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Embedding a ring in a hypercube with both faulty links and faulty nodes / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/1097-0037(200103)37:2<84::aid-net3>3.0.co;2-a / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994922227 / rank | |||
Normal rank | |||
| Property / title | |||
Embedding longest fault-free paths in arrangement graphs with faulty vertices (English) | |||
| Property / title: Embedding longest fault-free paths in arrangement graphs with faulty vertices (English) / rank | |||
Normal rank | |||
Latest revision as of 11:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding longest fault-free paths in arrangement graphs with faulty vertices |
scientific article |
Statements
20 June 2001
0 references
arrangement graph
0 references
star graph
0 references
Embedding longest fault-free paths in arrangement graphs with faulty vertices (English)
0 references
