A permutation with no fixed points is called a derangement.The subset $mathcal{D}$ of a permutation group is derangement if all elements of $mathcal{D}$ are derangement.Let $G$ be a permutation group, a derangementgraph is one with vertex set $G$ and derangement set $mathcal{D}$ as connecting set. In this paper, we determine the spectrum of derangement graphs of order a product of three primes.

where θ is the density of impurities, μθ the collisional diffusivity, and ζ = mθ qθ e mi ρs Ln the influence of inertia, which enters via the polarization drift. The latter makes the flow compressible, consequently for ideal (massless) impurities, ζ = 0 and advection is due to the incompressible electric drift only. In all cases the impurity density is assumed to be so low compared to the bulk ...

The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...

Consider the random vector (X,Y ), where Y represents a response variable and X an explanatory variable. The response Y is subject to random right censoring, whereas X is completely observed. Let m(x) be a conditional location function of Y given X = x. In this paper we assume that m(·) belongs to some parametric class M = {mθ : θ ∈ Θ} and we propose a new method for estimating the true unknown...

Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling$fcolon V(D)to {0, 1, 2}$such that every vertex with label $0$ has an in-neighbor with label $2$. A set ${f_1,f_2,ldots,f_d}$ ofRoman dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vin V(D)$,is called a {em Roman dominating family} (of functions) on $D$....

An {em Italian dominating function} on a digraph $D$ with vertex set $V(D)$ is defined as a function$fcolon V(D)to {0, 1, 2}$ such that every vertex $vin V(D)$ with $f(v)=0$ has at least two in-neighborsassigned 1 under $f$ or one in-neighbor $w$ with $f(w)=2$. A set ${f_1,f_2,ldots,f_d}$ of distinctItalian dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vi...

We have performed a dynamical analysis of the mixing in the pseudoscalar channel with the goal of understanding the existence and behavior of the pseudoscalar glueball. Our philosophy has not been to predict precise values of the glueball mass but to exploit an adequate effective theory to the point of breaking and to analyze which kind of mechanisms restore compatibility with data. Our study h...