Reliability properties of the hypercube network (Q1102261): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0898-1221(87)90049-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969490744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5546438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable circuits using less reliable relays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact calculation of computer network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the properties of arbitrary hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Diagnosis in a Boolean n Cube Array of Microprocessors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Indirect Binary n-Cube Microprocessor Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing and the critical group of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph theoretic reliability analysis for the Boolean n cube networks / rank
 
Normal rank

Latest revision as of 17:07, 18 June 2024

scientific article
Language Label Description Also known as
English
Reliability properties of the hypercube network
scientific article

    Statements

    Reliability properties of the hypercube network (English)
    0 references
    0 references
    1987
    0 references
    It is well known that for a network with equal and independent edge failure probabilities \(\rho\), the most reliable networks are those with max \(\lambda\) and super \(\lambda\) properties, when \(\rho\) is small. In this paper we will show that the hypercube networks posses both max \(\lambda\) and super \(\lambda\) properties. In addition, some other properties such as point transitive, Hamiltonian and the average message distance of the hypercube network are also derived.
    0 references
    0 references
    reliable networks
    0 references
    hypercube networks
    0 references
    point transitive
    0 references
    Hamiltonian
    0 references
    average message distance
    0 references
    0 references