This paper determines all arc-transitive pentavalent graphs of order 4pq, where q > p > 5 are primes. The cases p = 1, 2, 3 and p = q is a prime have been treated previously by Hua et al. [Pentavalent symmetric graphs of order 2pq, Discrete Math. 311 (2011), 2259-2267], Hua and Feng [Pentavalent symmetric graphs of order 8p, J. Beijing Jiaotong University 35 (2011), 132-135], Guo et al. [Pentav...

The symmetric m-th power of a graph is the graph whose vertices are m-subsets of vertices and in which two m-subsets are adjacent if and only if their symmetric difference is an edge of the original graph. It was conjectured that there exists a fixed m such that any two graphs are isomorphic if and only if their m-th symmetric powers are cospectral. In this paper we show that given a positive i...

We obtain a pointwise, a priori bound for the vorticity of axis symmetric solutions to the 3 dimensional Navier-Stokes equations. The bound is in the form of a reciprocal of a power of the distance to the axis of symmetry. This seems to be the first general pointwise estimate established for the axis symmetric Navier-Stokes equations.

Many combinatorial generating functions can be expressed as combinations of symmetric functions, or extracted as sub-series and specializations from such combinations. Gessel has outlined a large class of symmetric functions for which the resulting generating functions are D-finite. We extend Gessel’s work by providing algorithms that compute differential equations these generating functions sa...

Convergence to a single steady state is shown for non-negative and radially symmetric solutions to a diffusive Hamilton-Jacobi equation with homogeneous Dirichlet boundary conditions, the diffusion being the p-Laplacian operator, p ≥ 2, and the source term a power of the norm of the gradient of u. As a first step, the radially symmetric and non-increasing stationary solutions are characterized.

This paper investigates the relationship between test data compression and power dissipation during scan testing. It is shown how combining a recently proposed symmetric coding scheme and a new weighted scan latch reordering (W-SLR) algorithm, leads to efficient exploration in the scan power and test data compression solution space. This is achieved by reducing and, at the same time, balancing ...

The standard error bounds for interpolation by kernels or radial basis functions are generalized to symmetric PDE collocation problems. This involves generalized Power Functions, and these can be explicitly calculated. Final error bounds then are a product of Power Function values and the norm of the solution in the native space of the kernel. Since the latter can also be estimated well, the wh...

let $g$ be a finite group and $gamma(g)$ the prime graph of $g$‎. ‎recently people have been using prime graphs to study simple groups‎. ‎naturally we pose a question‎: ‎can we use prime graphs to study almost‎ ‎simple groups or non-simple groups? in this paper some results in‎ ‎this respect are obtained and as follows‎: ‎$gcong s_p$ if and only‎ ‎if $|g|=|s_p|$ and $gamma(g)=gamma(s_p)$‎, ‎whe...