A line digraph of a complete bipartite digraph (Q1021880): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1566001
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ji Xiang Meng / rank
 
Normal rank
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.1016/j.aml.2008.04.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064627777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite regular graphs with fixed diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Moore bipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multipartite Moore digraphs / 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: Q5341580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large generalized cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435203 / rank
 
Normal rank

Latest revision as of 16:02, 1 July 2024

scientific article
Language Label Description Also known as
English
A line digraph of a complete bipartite digraph
scientific article

    Statements

    A line digraph of a complete bipartite digraph (English)
    0 references
    0 references
    0 references
    0 references
    9 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    Moore-like bound
    0 references
    Moore bipartite digraphs
    0 references
    line digraph
    0 references
    0 references