The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
Abstract: Version 9 of the Amber simulation programs includes a new semi-empirical hybrid QM/MM functionality. This includes support for implicit solvent (generalized Born) and for...
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
Standing (solitary)-wave/steady-state solutions in many nonlinear wave motions and Schrodinger flows lead to nonlinear eigenproblems. In [X. Yao and J. Zhou, SIAM J. Sci. Comput., ...
A novel approach to the X-ray tomography problem with sparse projection data is proposed. Non-negativity of the X-ray attenuation coefficient is enforced by modelling it as max{(x)...