A sufficient condition for graphs to be super \(k\)-restricted edge connected (Q2364076): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.7151/dmgt.1939 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2560206910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes / 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: 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: 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: A neighborhood condition for graphs to be maximally \(k\)-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: Sufficient conditions for \(k\)-restricted edge connected 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: Reliability analysis of bijective connection networks in terms of the extra edge-connectivity / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:04, 14 July 2024

scientific article
Language Label Description Also known as
English
A sufficient condition for graphs to be super \(k\)-restricted edge connected
scientific article

    Statements

    A sufficient condition for graphs to be super \(k\)-restricted edge connected (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 July 2017
    0 references
    0 references
    neighborhood
    0 references
    \(k\)-restricted edge connectivity
    0 references
    super \(k\)-restricted edge connected graph
    0 references
    0 references