Restricted arc-connectivity of digraphs (Q2379978): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: On computing a conditional edge-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2764679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted edge-connectivity of graphs. / rank
 
Normal rank

Latest revision as of 15:24, 2 July 2024

scientific article
Language Label Description Also known as
English
Restricted arc-connectivity of digraphs
scientific article

    Statements

    Restricted arc-connectivity of digraphs (English)
    0 references
    0 references
    24 March 2010
    0 references
    0 references
    edge-connectivity
    0 references
    arc-connectivity
    0 references
    fault tolerance
    0 references
    restricted edge-connectivity
    0 references
    restricted arc-connectivity
    0 references
    complexity
    0 references
    0 references