Large \((d,D, D',s)\)-bipartite digraphs (Q1891920): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linegraph of a directed-graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large fault-tolerant interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense bipartite 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: Q4721969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large \((d,D, D',s)\)-bipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(93)e0165-u / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051750559 / rank
 
Normal rank

Latest revision as of 10:22, 30 July 2024

scientific article
Language Label Description Also known as
English
Large \((d,D, D',s)\)-bipartite digraphs
scientific article

    Statements

    Large \((d,D, D',s)\)-bipartite digraphs (English)
    0 references
    0 references
    10 January 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    line digraph
    0 references
    distance
    0 references
    interconnection networks
    0 references
    bipartite digraph
    0 references
    diameter
    0 references
    out-degree
    0 references
    digraph
    0 references
    Menger-type condition
    0 references
    disjoint paths
    0 references
    upper bound
    0 references
    0 references