Asymptotically large (\(\Delta,D\))-graphs (Q2576342): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2005.03.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974840557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large graphs with given degree and diameter. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on constructing large Cayley graphs of given degree and diameter by voltage assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of a. kotzig concerning factorizations of 4‐regular graphs / 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: Q4712019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs on alphabets as models for large interconnection networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 14:28, 11 June 2024

scientific article
Language Label Description Also known as
English
Asymptotically large (\(\Delta,D\))-graphs
scientific article

    Statements

    Asymptotically large (\(\Delta,D\))-graphs (English)
    0 references
    0 references
    0 references
    27 December 2005
    0 references
    degree-diameter problem
    0 references
    de Bruijn digraph
    0 references
    Kautz digraph
    0 references
    exchange graph
    0 references
    graph-digraph product
    0 references

    Identifiers