16,350 research outputs found

    Cubic vertex-transitive non-Cayley graphs of order 12p

    Full text link
    A graph is said to be {\em vertex-transitive non-Cayley} if its full automorphism group acts transitively on its vertices and contains no subgroups acting regularly on its vertices. In this paper, a complete classification of cubic vertex-transitive non-Cayley graphs of order 12p12p, where pp is a prime, is given. As a result, there are 1111 sporadic and one infinite family of such graphs, of which the sporadic ones occur when p=5p=5, 77 or 1717, and the infinite family exists if and only if p1 (mod4)p\equiv1\ (\mod 4), and in this family there is a unique graph for a given order.Comment: This paper has been accepted for publication in SCIENCE CHINA Mathematic

    A Note on the Monge-Kantorovich Problem in the Plane

    Full text link
    The Monge-Kantorovich mass-transportation problem has been shown to be fundamental for various basic problems in analysis and geometry in recent years. Shen and Zheng (2010) proposed a probability method to transform the celebrated Monge-Kantorovich problem in a bounded region of the Euclidean plane into a Dirichlet boundary problem associated to a nonlinear elliptic equation. Their results are original and sound, however, their arguments leading to the main results are skipped and difficult to follow. In the present paper, we adopt a different approach and give a short and easy-followed detailed proof for their main results
    corecore