let $g$ be a simple graph‎, ‎and $g^{sigma}$‎ ‎be an oriented graph of $g$ with the orientation ‎$sigma$ and skew-adjacency matrix $s(g^{sigma})$‎. ‎the $k-$th skew spectral‎ ‎moment of $g^{sigma}$‎, ‎denoted by‎ ‎$t_k(g^{sigma})$‎, ‎is defined as $sum_{i=1}^{n}( ‎‎‎lambda_{i})^{k}$‎, ‎where $lambda_{1}‎, ‎lambda_{2},cdots‎, ‎lambda_{n}$ are the eigenvalues of $g^{sigma}$‎. ‎suppose‎ ‎$g^{sigma...

We consider the nonlinear Dirac equations (NLDE's) in 1+1 dimension with scalar-scalar self interaction g{2}/k+1(ΨΨ){k+1} , as well as a vector-vector self interaction g{2}/k+1(Ψγ{μ}ΨΨγ{μ}Ψ){1/2(k+1)} . We find the exact analytic form for solitary waves for arbitrary k and find that they are a generalization of the exact solutions for the nonlinear Schrödinger equation (NLSE) and reduce to thes...

Treatment with glutamine has been shown to reduce myocardial damage associated with ischemia/reperfusion injury. However, the cardioprotective effect of glutamine specifically after burn injury remains unclear. The present study explores the ability of glutamine to protect against myocardial damage in rats that have been severely burned. Seventy-two Wistar rats were randomly divided into three ...

‎for any integer $kge 1$‎, ‎a minus $k$-dominating function is a‎ ‎function $f‎ : ‎v (g)rightarrow {-1,0‎, ‎1}$ satisfying $sum_{win‎‎n[v]} f(w)ge k$ for every $vin v(g)$‎, ‎where $n(v) ={u in‎‎v(g)mid uvin e(g)}$ and $n[v] =n(v)cup {v}$‎. ‎the minimum of‎‎the values of $sum_{vin v(g)}f(v)$‎, ‎taken over all minus‎‎$k$-dominating functions $f$‎, ‎is called the minus $k$-domination‎‎number and i...

Controlled frames in Hilbert spaces have been recently introduced by P. Balazs and etc. for improving the numerical efficiency of interactive algorithms for inverting the frame operator. In this paper we develop a theory based on g-fusion frames on Hilbert spaces, which provides exactly the frameworks not only to model new frames on Hilbert spaces but also for deriving robust operators. In part...

a set $s$ of vertices in a graph $g=(v,e)$ is called a total$k$-distance dominating set if every vertex in $v$ is withindistance $k$ of a vertex in $s$. a graph $g$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (g - x) < gamma_{t}^{k}(g)$ for any vertex $xin v(g)$. in this paper,we investigate some results on total $k$-distance domination-critical of graphs.