Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness (Q1602687): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A group-theoretic model for symmetric interconnection networks / 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: Q4309106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating from the dominant of the spanning tree polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing tough graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional arboricity, strength, and principal partitions in graphs and matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm for computing the strength of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Day-Tripathi orientation of the star graphs: connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5460881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal attack and reinforcement of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unidirectional star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and edge-disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of interconnection networks based on the alternating group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / 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: The 4-star graph is not a subgraph of any hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of transitive graphs / rank
 
Normal rank

Latest revision as of 11:06, 4 June 2024

scientific article
Language Label Description Also known as
English
Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
scientific article

    Statements

    Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness (English)
    0 references
    0 references
    0 references
    24 June 2002
    0 references
    The authors study the system topology of the distributed processor architecture: star graphs, altenating group graphs and split-stars. They define and study two measures of vulnerability for this three types of graphs: strength and toughness. Their results are very interesting and general.
    0 references
    0 references
    connectivity
    0 references
    star graphs
    0 references
    split-stars
    0 references
    vulnerability
    0 references
    toughness
    0 references