A note on large graphs of diameter two and given maximum degree (Q1272472): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jctb.1998.1828 / rank
Normal rank
 
Property / author
 
Property / author: Brendan D. McKay / rank
 
Normal rank
Property / author
 
Property / author: Jozef Širáň / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Ján Plesník / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: nauty / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014150215 / 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: On Graphs that do not Contain a Thomsen Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320418 / 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: Examples of products giving large graphs with given degree and diameter / 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: Maximum degree in graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in algebraic combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Moore Graphs with Diameters 2 and 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference between consecutive primes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCTB.1998.1828 / rank
 
Normal rank

Latest revision as of 17:13, 10 December 2024

scientific article
Language Label Description Also known as
English
A note on large graphs of diameter two and given maximum degree
scientific article

    Statements

    A note on large graphs of diameter two and given maximum degree (English)
    0 references
    0 references
    0 references
    0 references
    23 April 1999
    0 references
    The well-known degree/diameter problem asks for determining the largest number of vertices in a graph of maximum degree \(d\) and diameter \(k\). In this paper the case of vertex-transitive graphs and \(k=2\) is considered. The upper (Moore) bound is \(d^2+1\), but the previously known lower bound was asymptotically only \(d^2/4\). Using voltage graphs, the authors construct vertex-transitive non-Cayley graphs with asymptotically \(8d^2/9\) vertices for a selected sequence of \(d\)'s.
    0 references
    graph
    0 references
    degree
    0 references
    diameter
    0 references
    group
    0 references
    Moore bound
    0 references
    vertex-transitive
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references