Diameters of random circulant graphs (Q2439833): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114640788 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1103.3152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal lower bound for the Frobenius problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of a random Cayley graph of ℤ q / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for Frobenius numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distribution of lattice points visible from the origin / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistics of the trajectory of a certain billiard in a flat two-torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diameter of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diameter of a Cycle Plus a Random Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of a scale-free random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3843706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulant graphs and tessellations on flat tori / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5787302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters in Supercritical Random Graphs Via First Passage Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Voronoi's reduction theory and its application / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity and diameter of small-world networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice covering of space with symmetric convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random cutting and records in deterministic and random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice translates of a polytope and the Frobenius problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Modern Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective limit distribution of the Frobenius numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic distribution of Frobenius numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kinetic transport in the two-dimensional periodic Lorentz gas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distribution of free path lengths in the periodic Lorentz gas and related lattice point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical random graphs: Diameter and mixing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal-Path Algorithm for the "Money Changing Problem" / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diameter of Sparse Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice coverings of space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted multi-connected loop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small solutions to linear congruences and Hecke equidistribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limit distribution of Frobenius numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of Frobenius numbers with three arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Diameter in Multiple-Loop Networks / rank
 
Normal rank

Latest revision as of 12:14, 7 July 2024

scientific article
Language Label Description Also known as
English
Diameters of random circulant graphs
scientific article

    Statements

    Diameters of random circulant graphs (English)
    0 references
    0 references
    0 references
    17 March 2014
    0 references
    The authors consider circulant graphs and calculate diameters of these graphs. The diameter of a graph is an important aspect of a graph which is defined as the maximum distance between all vertices of the graph. They make their calculations by means of the length of the shortest cycle in a directed quotient lattice graph.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    circulant graph
    0 references
    diameter of a graph
    0 references
    connectedness of a network
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references