Vertex-symmetric digraphs with small diameter (Q1805459): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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: Message Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results for the degree/diameter problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688411 / 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: Determining the Hamilton-connectedness of certain vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4041603 / rank
 
Normal rank

Revision as of 13:31, 23 May 2024

scientific article
Language Label Description Also known as
English
Vertex-symmetric digraphs with small diameter
scientific article

    Statements

    Vertex-symmetric digraphs with small diameter (English)
    0 references
    19 June 1995
    0 references
    New families of large vertex-symmetric digraphs with a given maximum out- degree \(\Delta\) and diameter at most \(D\) are presented. The authors use certain digraphs on alphabets and develop new construction techniques. The largest known vertex-symmetric \((\Delta, D)\) digraphs are surveyed in a table.
    0 references
    0 references
    vertex symmetry
    0 references
    large vertex-symmetric digraphs
    0 references
    out-degree
    0 references
    diameter
    0 references
    digraphs on alphabets
    0 references
    0 references
    0 references

    Identifiers