Three-arc graphs: characterization and domination

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two arcs $uv, xy$ are adjacent if and only if $(v,u,x,y)$ is a 3-arc of $G$. In this paper we give a characterization of 3-arc graphs and obtain sharp upper bounds on the domination number of the 3-arc graph of a graph $G$ in terms that of $G$

Relativistic Hartree approach including both positive- and negative-energy bound states

We develop a relativistic model to describe the bound states of positive energy and negative energy in finite nuclei at the same time. Instead of searching for the negative-energy solution of the nucleon's Dirac equation, we solve the Dirac equations for the nucleon and the anti-nucleon simultaneously. The single-particle energies of negative-energy nucleons are obtained through changing the sign of the single-particle energies of positive-energy anti-nucleons. The contributions of the Dirac sea to the source terms of the meson fields are evaluated by means of the derivative expansion up to the leading derivative order for the one-meson loop and one-nucleon loop. After refitting the parameters of the model to the properties of spherical nuclei, the results of positive-energy sector are similar to that calculated within the commonly used relativistic mean field theory under the no-sea approximation. However, the bound levels of negative-energy nucleons vary drastically when the vacuum contributions are taken into account. It implies that the negative-energy spectra deserve a sensitive probe to the effective interactions in addition to the positive-energy spectra