let $g$ be a connected graph with vertex set $v(g)$‎. ‎the‎ ‎degree resistance distance of $g$ is defined as $d_r(g) = sum_{{u‎,‎v} subseteq v(g)} [d(u)+d(v)] r(u,v)$‎, ‎where $d(u)$ is the degree‎ ‎of vertex $u$‎, ‎and $r(u,v)$ denotes the resistance distance between‎ ‎$u$ and $v$‎. ‎in this paper‎, ‎we characterize $n$-vertex unicyclic‎ ‎graphs having minimum and second minimum degree resista...

<span lang="EN-US">This study examined the effectiveness and level of distance-teaching services provided to students with autism spectrum disorder in United Arab Emirates, Emirate Abu Dhabi (from a viewpoint teachers parents). To achieve goals, distance education assessment tool was built two forms. The data collection for this done by distributing online questionnaires all participants....

For a finite commutative ring $\mathbb{Z}_{n}$ with identity $1\neq 0$, the zero divisor graph $\Gamma(\mathbb{Z}_{n})$ is simple connected having vertex set as of non-zero divisors, where two vertices $x$ and $y$ are adjacent if only $xy=0$. We find distance Laplacian spectrum graphs for different values $n$. Also, we obtain $n=p^z$, $z\geq 2$, in terms spectrum. As consequence, determine thos...

Today’s wireless networks are characterized by fixed spectrum assignment policy. The limited available spectrum and the inefficiency in the spectrum usage necessitate a new communication paradigm to exploit the existing wireless spectrum opportunistically. Cognitive radio is a paradigm for wireless communication in which either a network or a wireless node changes its transmission or reception ...