\(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs (Q479049): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2014.10.008 / rank
Normal rank
 
Property / author
 
Property / author: Shi-ying Wang / rank
Normal rank
 
Property / author
 
Property / author: Lei Zhang / rank
Normal rank
 
Property / author
 
Property / author: Shang-Wei Lin / rank
Normal rank
 
Property / author
 
Property / author: Lei Zhang / rank
 
Normal rank
Property / author
 
Property / author: Shi-ying Wang / rank
 
Normal rank
Property / author
 
Property / author: Shang-Wei Lin / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C82 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6377059 / rank
 
Normal rank
Property / zbMATH Keywords
 
interconnection network
Property / zbMATH Keywords: interconnection network / rank
 
Normal rank
Property / zbMATH Keywords
 
restricted edge connectivity
Property / zbMATH Keywords: restricted edge connectivity / rank
 
Normal rank
Property / zbMATH Keywords
 
clique
Property / zbMATH Keywords: clique / 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.2014.10.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056376345 / 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: 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
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2014.10.008 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:42, 9 December 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