LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS (Q2909108): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the connectivity and superconnected graphs with small diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of reliable networks - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulants and their connectivities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted connectivity for three families of interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-connectivity and super-edge-connectivity for some interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearly many faults in Cayley graphs generated by transposition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the connectivity of the star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vosperian and superconnected abelian Cayley digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts leaving components of given minimum order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal connected component of hypercube with faulty vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal connected component of hypercube with faulty vertices (II) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal connected component of a hypercube with faulty vertices III / rank
 
Normal rank

Latest revision as of 14:25, 5 July 2024

scientific article
Language Label Description Also known as
English
LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS
scientific article

    Statements

    LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS (English)
    0 references
    0 references
    0 references
    0 references
    29 August 2012
    0 references
    \((n,k)\)-star graphs
    0 references
    structural properties
    0 references
    fault-tolerant
    0 references

    Identifiers