Super edge-connectivity of dense digraphs and graphs (Q1199454): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3922713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large fault-tolerant interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of reliable networks - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Invulnerability of the Regular Complete <i>k</i>-Partite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super Line-Connectivity Properties of Circulant Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the impossibility of directed Moore graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5834367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-bounds on the connectivities of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally connected digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line Digraph Iterations and the (d, k) Digraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the design of reliable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design to Minimize Diameter on Building-Block Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Design for Directed Graphs with Minimum Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Regular Directed Graphs with Small Diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with the smallest number of minimum cut sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for maximally connected dense graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(92)90155-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995580361 / rank
 
Normal rank

Latest revision as of 10:08, 30 July 2024

scientific article
Language Label Description Also known as
English
Super edge-connectivity of dense digraphs and graphs
scientific article

    Statements

    Super edge-connectivity of dense digraphs and graphs (English)
    0 references
    0 references
    16 January 1993
    0 references
    dense digraphs
    0 references
    interconnection network
    0 references
    super-\(\lambda\)
    0 references
    network reliability
    0 references
    edge-connectivity
    0 references
    diameter
    0 references
    minimum edge-cut sets
    0 references
    de Bruijn digraph
    0 references
    Kautz digraph
    0 references

    Identifiers