\(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs (Q479049): 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: The \(k\)-restricted edge-connectivity of a product of graphs / 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 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 a kind of reliability analysis of networks / 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: \(k\)-restricted edge-connectivity in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super restricted edge connectivity of regular graphs with two orbits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on 4-restricted edge connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for maximally restricted edge connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\) / 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: Q5781249 / 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: Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of an inequality concerning \(k\)-restricted edge connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal / rank
 
Normal rank

Revision as of 09:27, 9 July 2024

scientific article
Language Label Description Also known as
English
\(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
scientific article

    Statements

    \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    5 December 2014
    0 references
    interconnection network
    0 references
    restricted edge connectivity
    0 references
    clique
    0 references
    0 references
    0 references

    Identifiers