Some special minimum \(k\)-geodetically connected graphs (Q548276): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimum 3-geodetically connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recognition of geodetically connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing hinge-free line graphs and total graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodetic connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum self-repairing graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3661607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards minimum<i>k</i>-geodetically connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum<i>k</i>-geodetically connected digraphs / rank
 
Normal rank

Latest revision as of 06:10, 4 July 2024

scientific article
Language Label Description Also known as
English
Some special minimum \(k\)-geodetically connected graphs
scientific article

    Statements

    Some special minimum \(k\)-geodetically connected graphs (English)
    0 references
    0 references
    0 references
    28 June 2011
    0 references
    0 references
    minimum size graph
    0 references
    geodetic connectivity
    0 references
    distance invulnerability
    0 references
    robust system design
    0 references
    survivable network
    0 references
    0 references