On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks (Q606827): 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/j.amc.2010.07.073 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035966111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable circuits using less reliable relays / 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: Combinatorial optimization problems in the analysis and design of probabilistic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing a conditional edge-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-cuts leaving components of order at least three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extraconnectivity of graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge cuts leaving components of order at least \(m\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional edge connectivity properties, reliability comparisons and transitivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for λ′‐optimality in graphs with girth <i>g</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally edge-connected and vertex-connected graphs and digraphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimally 3-restricted edge connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-restricted edge connectivity of undirected binary Kautz graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted edge-connectivity of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463565 / 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: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimale \(n\)-fach kantenzusammenhängende Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521361 / rank
 
Normal rank

Latest revision as of 12:25, 3 July 2024

scientific article
Language Label Description Also known as
English
On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
scientific article

    Statements

    On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks (English)
    0 references
    0 references
    18 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    hypercube network
    0 references
    edge connectivity
    0 references
    network reliability
    0 references
    0 references