Vulnerability of nearest neighbor graphs (Q2449104): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4339095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Nonplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly connected random geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness in graphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separator theorem for graphs of bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490019 / 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: Rupture degree of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic convexity and inequalities for the gamma function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separators for sphere-packings and nearest neighbor graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Separators for Finite-Element Meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tenacity of a graph with maximum connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isoperimetric numbers of graphs / rank
 
Normal rank

Latest revision as of 12:25, 8 July 2024

scientific article
Language Label Description Also known as
English
Vulnerability of nearest neighbor graphs
scientific article

    Statements

    Vulnerability of nearest neighbor graphs (English)
    0 references
    0 references
    0 references
    6 May 2014
    0 references
    0 references
    integrity
    0 references
    toughness
    0 references
    tenacity
    0 references
    scattering number
    0 references
    rupture degree
    0 references
    separators
    0 references
    0 references