Edge fault tolerance of graphs with respect to super edge connectivity (Q412367): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: On the edge-connectivity and restricted edge-connectivity of a product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 3-restricted edge connectivity of permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: On connectivity of the cartesian product of two graphs / 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: On the extraconnectivity of graphs / 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: Maximally edge-connected and vertex-connected graphs and digraphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super edge connectivity properties of connected edge symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimale \(n\)-fach kantenzusammenhängende Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4189309 / 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: Q4393242 / 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: Some remarks on \(\lambda _{p,q}\)-connectedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super edge- and point-connectivities of the Cartesian product of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870157 / 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: On restricted edge-connectivity of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimally-\(\lambda^{(3)}\) transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492623 / 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 03:03, 5 July 2024

scientific article
Language Label Description Also known as
English
Edge fault tolerance of graphs with respect to super edge connectivity
scientific article

    Statements

    Edge fault tolerance of graphs with respect to super edge connectivity (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2012
    0 references
    fault tolerance
    0 references
    super edge connected
    0 references
    Cartesian product graph
    0 references
    edge transitive graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers