Towards minimum<i>k</i>-geodetically connected graphs (Q4804165): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.10060 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1499566842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509380 / 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: The recognition of geodetically connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint shortest paths in graphs / 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: Q3661607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Communication Networks with Survivability Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum<i>k</i>-geodetically connected digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3834075 / rank
 
Normal rank

Latest revision as of 15:11, 5 June 2024

scientific article; zbMATH DE number 1896656
Language Label Description Also known as
English
Towards minimum<i>k</i>-geodetically connected graphs
scientific article; zbMATH DE number 1896656

    Statements

    Towards minimum<i>k</i>-geodetically connected graphs (English)
    0 references
    0 references
    0 references
    10 April 2003
    0 references
    minimum-size graph
    0 references
    distance invulnerability
    0 references
    geodetic connectivity
    0 references
    survivable network
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references