The minimum number of edges and vertices in a graph with edge connectivity 𝑛 and π‘š 𝑛-bonds (Q4773729): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
β€ŽChanged an Item
ReferenceBot (talk | contribs)
β€ŽChanged an Item
Β 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
Β 
Property / MaRDI profile type: MaRDI publication profile / rank
Β 
Normal rank
Property / cites work
Β 
Property / cites work: Minimal k‐arc connected graphs / rank
Β 
Normal rank
Property / cites work
Β 
Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank
Β 
Normal rank
Property / cites work
Β 
Property / cites work: Q5726070 / rank
Β 
Normal rank
Property / cites work
Β 
Property / cites work: Q5524326 / rank
Β 
Normal rank
Property / cites work
Β 
Property / cites work: Lectures on matroids / rank
Β 
Normal rank
Property / cites work
Β 
Property / cites work: Network reliability analysis: Part I / rank
Β 
Normal rank

Latest revision as of 15:08, 12 June 2024

scientific article; zbMATH DE number 3450241
Language Label Description Also known as
English
The minimum number of edges and vertices in a graph with edge connectivity 𝑛 and π‘š 𝑛-bonds
scientific article; zbMATH DE number 3450241

    Statements

    The minimum number of edges and vertices in a graph with edge connectivity 𝑛 and π‘š 𝑛-bonds (English)
    0 references
    1974
    0 references
    0 references
    0 references