For a graph $G = (V, E)$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_k}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i$ dominates $V_j$ or $V_j$ dominates $V_i$ or both for every $V_i, V_j in pi$, whenever $i neq j$. The textit{upper domatic number} $D(G)$ is the maximum order of an upper domatic partition. We study the properties of upper domatic number and propose an up...

here a posteriori error estimate for the numerical solution of nonlinear voltena- hammerstein equations is given. we present an error upper bound for nonlinear voltena-hammastein integral equations, in which the form of nonlinearity is algebraic and develop a posteriori error estimate for the recently proposed method of brunner for these problems (the implicitly linear collocation method).we al...

In this paper, a new numerical method for solving the fractional Riccati differential  equation is presented. The fractional derivatives are described in the Caputo sense. The method is based upon  fractional-order Bernoulli functions approximations. First, the  fractional-order Bernoulli functions and  their properties are  presented. Then, an operational matrix of fractional order integration...

Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...

In supersymmetric models the lightest Higgs boson may decay with a sizable branching ratio into a pair of light neutralinos. We analyze such decays within the context of the minimal supersymmetric standard model with R-parity violation, where the neutralino itself is unstable and decays into Standard Model fermions. We show that the R-parity violating couplings induce novel Higgs decay signals ...

We propose a method for upper bounding the general adversary bound for certain boolean functions. Due to the the tightness of query complexity and the general adversary bound [5], this gives an upper bound on the quantum query complexity of those functions. We give an example where this upper bound is smaller than the query complexity of any known quantum algorithm.