A lower bound on the size of \((H;1)\)-vertex stable graphs (Q456894): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On \((C_n;k)\) stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (H,k) stable graphs with minimum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex stability with regard to complete bipartite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (H,k) stable bipartite graphs with the minimum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \((K_q,k)\) vertex stable graphs with minimum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \((K_{q},k)\) stable graphs with small \(k\) / rank
 
Normal rank

Latest revision as of 19:18, 5 July 2024

scientific article
Language Label Description Also known as
English
A lower bound on the size of \((H;1)\)-vertex stable graphs
scientific article

    Statements

    A lower bound on the size of \((H;1)\)-vertex stable graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 October 2012
    0 references
    vertex stable graphs
    0 references
    minimum size
    0 references
    minimum degree
    0 references
    connectivity
    0 references

    Identifiers