Diameter vulnerability of graphs by edge deletion (Q1011748): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Diameter bounds for altered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4669880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4906805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter vulnerability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter increase caused by edge deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3417284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Application of Graphs / rank
 
Normal rank

Revision as of 11:00, 1 July 2024

scientific article
Language Label Description Also known as
English
Diameter vulnerability of graphs by edge deletion
scientific article

    Statements

    Diameter vulnerability of graphs by edge deletion (English)
    0 references
    0 references
    0 references
    0 references
    9 April 2009
    0 references
    diameter
    0 references
    edge-deletion
    0 references
    diameter vulnerability
    0 references
    edge-connected graph
    0 references

    Identifiers