Transferring non-specialised tasks from registered nurses to nursing assistants may help registered nurses focus on specialised tasks. Optimising the workflow of nursing assistants by making their tasks more efficient may improve problems associated with the shortage of registered nurses. The nursing assistants at our hospital were stressed about referring inpatients to outpatient specialty cli...

*Correspondence: [email protected] 1School of Natural Sciences (SNS), National University of Sciences and Technology (NUST), Sector H-12, Islamabad, Pakistan 2Department of Mathematical Sciences, United Arab Emirates University, P.O. Box 15551, Al Ain, United Arab Emirates Full list of author information is available at the end of the article Abstract Let G be a connected graph. The degree of...

The eXtensible Markup Language (XML) is becoming a new standard for information representation and exchange over the Internet. How to index XML data for efficient query processing and XML transformation is an important subject in the XML community. In this paper, based on extended preorder indexing method, we add path information as part of the index. It is shown that the number of path joins c...

In this paper we consider general rst order autoregression, including the stationary, the explosive and the unstable case. It is well-known in the literature that the usual bootstrap method for the least squares parameter estimator is asymptotically consistent for the stationary and the explosive case, but does not work in the unstable case, where the parameter value is equal to + 1 or {1. We p...

‎The Narumi-Katayama index was the first topological index defined‎ ‎by the product of some graph theoretical quantities‎. ‎Let $G$ be a ‎simple graph with vertex set $V = {v_1,ldots‎, ‎v_n }$ and $d(v)$ be‎ ‎the degree of vertex $v$ in the graph $G$‎. ‎The Narumi-Katayama ‎index is defined as $NK(G) = prod_{vin V}d(v)$‎. ‎In this paper,‎ ‎the Narumi-Katayama index is generalized using a $n$-ve...

Let $G=(V,E)$ be a simple connectedgraph with $n$ vertices, $m$ edges and sequence of vertex degrees$d_1 ge d_2 ge cdots ge d_n>0$, $d_i=d(v_i)$, where $v_iin V$. With $isim j$ we denote adjacency ofvertices $v_i$ and $v_j$. The generalsum--connectivity index of graph is defined as $chi_{alpha}(G)=sum_{isim j}(d_i+d_j)^{alpha}$, where $alpha$ is an arbitrary real<b...