Vulnerability parameters of split graphs (Q5438691): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The toughness of split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of posets and the corresponding comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Scattering Number of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattering number in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rupture degree of graphs / rank
 
Normal rank

Latest revision as of 15:59, 27 June 2024

scientific article; zbMATH DE number 5230106
Language Label Description Also known as
English
Vulnerability parameters of split graphs
scientific article; zbMATH DE number 5230106

    Statements

    Vulnerability parameters of split graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 January 2008
    0 references
    0 references
    integrity
    0 references
    rupture degree
    0 references
    scattering number
    0 references
    split graph
    0 references
    submodular function
    0 references
    tenacity
    0 references
    0 references