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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Lei Zhang / 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

Revision as of 18:46, 30 June 2023

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
    0 references
    5 December 2014
    0 references
    interconnection network
    0 references
    restricted edge connectivity
    0 references
    clique
    0 references

    Identifiers