16,350 research outputs found
Cubic vertex-transitive non-Cayley graphs of order 12p
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 , where is a prime,
is given. As a result, there are sporadic and one infinite family of such
graphs, of which the sporadic ones occur when , or , and the
infinite family exists if and only if , 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
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
- …
