Sufficient conditions for \(k\)-restricted edge connected graphs (Q300253): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the restricted connectivity and superconnectivity in graphs with given girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superconnectivity of bipartite digraphs and 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: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted connectivities of permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On unreliability polynomials and graph connectivity in reliable network synthesis / 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: \(\{2,3\}\)-extraconnectivities of hypercube-like networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of most reliable 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: Extraconnectivity of graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extraconnectivity of \(k\)-ary \(n\)-cube networks / 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: Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally restricted edge connected elementary Harary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally super-edge-connected transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a kind of restricted edge connectivity of graphs / 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: Super restricted edge-connectivity of graphs with diameter 2 / 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 super \(k\)-restricted edge connectivity in graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for a graph to be super restricted edge-connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood conditions for graphs to be super restricted edge connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of an inequality concerning \(k\)-restricted edge connectivity / rank
 
Normal rank

Latest revision as of 05:26, 12 July 2024

scientific article
Language Label Description Also known as
English
Sufficient conditions for \(k\)-restricted edge connected graphs
scientific article

    Statements

    Sufficient conditions for \(k\)-restricted edge connected graphs (English)
    0 references
    0 references
    0 references
    27 June 2016
    0 references
    interconnection networks
    0 references
    \(k\)-restricted edge connectivity
    0 references
    \(\lambda_{k}\)-optimality
    0 references
    neighborhood
    0 references
    0 references

    Identifiers