Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected (Q1727755): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2018.07.027 / rank
Normal rank
 
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.1016/j.dam.2018.07.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2889968425 / rank
 
Normal rank
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: Edge fault tolerance analysis of super \(k\)-restricted connected networks / 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 the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\) / 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: Q5422499 / 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: On a kind of reliability analysis of networks / 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: Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally super-edge-connected transitive 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: Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 / 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
Property / cites work
 
Property / cites work: Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2018.07.027 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:07, 11 December 2024

scientific article
Language Label Description Also known as
English
Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
scientific article

    Statements

    Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected (English)
    0 references
    0 references
    0 references
    20 February 2019
    0 references
    interconnection network
    0 references
    \(k\)-restricted edge connectivity
    0 references
    \(\lambda_k\)-optimality
    0 references
    girth
    0 references
    0 references

    Identifiers