On large vertex-symmetric digraphs (Q1024427): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4770409 / 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: Vertex-symmetric digraphs with small diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Message Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle prefix digraphs for symmetric interconnection networks / 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: Q3688411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large vertex symmetric digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moore graphs and beyond: a survey of the degree/diameter problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4041603 / rank
 
Normal rank

Latest revision as of 16:47, 1 July 2024

scientific article
Language Label Description Also known as
English
On large vertex-symmetric digraphs
scientific article

    Statements

    On large vertex-symmetric digraphs (English)
    0 references
    0 references
    17 June 2009
    0 references
    graph
    0 references
    large digraph
    0 references
    vertex-symmetric digraph
    0 references

    Identifiers