24,050 research outputs found

    Line graphs and 22-geodesic transitivity

    Full text link
    For a graph Γ\Gamma, a positive integer ss and a subgroup G\leq \Aut(\Gamma), we prove that GG is transitive on the set of ss-arcs of Γ\Gamma if and only if Γ\Gamma has girth at least 2(s−1)2(s-1) and GG is transitive on the set of (s−1)(s-1)-geodesics of its line graph. As applications, we first prove that the only non-complete locally cyclic 22-geodesic transitive graphs are the complete multipartite graph K3[2]K_{3[2]} and the icosahedron. Secondly we classify 2-geodesic transitive graphs of valency 4 and girth 3, and determine which of them are geodesic transitive

    The geodesic flow on nilmanifolds associated to graphs

    Get PDF
    In this work we study the geodesic flow on nilmanifolds associated to graphs. We are interested in the construction of first integrals to show complete integrability on some compact quotients. Also examples of integrable geodesic flows and of non-integrable ones are shown.Comment: 22 page

    Geodesic Distance in Planar Graphs

    Full text link
    We derive the exact generating function for planar maps (genus zero fatgraphs) with vertices of arbitrary even valence and with two marked points at a fixed geodesic distance. This is done in a purely combinatorial way based on a bijection with decorated trees, leading to a recursion relation on the geodesic distance. The latter is solved exactly in terms of discrete soliton-like expressions, suggesting an underlying integrable structure. We extract from this solution the fractal dimensions at the various (multi)-critical points, as well as the precise scaling forms of the continuum two-point functions and the probability distributions for the geodesic distance in (multi)-critical random surfaces. The two-point functions are shown to obey differential equations involving the residues of the KdV hierarchy.Comment: 38 pages, 8 figures, tex, harvmac, eps
    • …
    corecore