the $k$-th semi total point graph $r^k(g)$ of a graph $g$, is a graph obtained from $g$ by adding $k$ vertices corresponding to each edge and connecting them to endpoint of edge considered. in this paper, we obtain formulae for the resistance distance and kirchhoff index of $r^k(g)$.

0

background: previous anatomic and radiological studies have described the relationship of the clavicle to major neurovascular structures in healthy subjects. we were curious about this relationship in patients with a clavicle fracture and if it is different from non-fractured clavicles.   methods: we retrospectively identified all patients with a clavicle fracture between july 2001 and october ...

background: we aimed to develop and evaluate outcomes of a blended learning (bl) program for nursing and midwifery education in iran. materials and methods: this was a participatory action research project. after designing bl website, providing technological infrastructures, and holding preparatory workshops, 22 blended courses were designed. bl method was implemented for one semester. students...

in addition to providing people with health care, medical science universities play a critical role in training skilled human forces required for different parts of the society. this calls for a constant review of medical staff and an attempt to eliminate the shortages. the aim of this study was to identify the barriers of electronic education development in the educational system of ahvaz jund...

this study aimsto investigate an aspect of marital interactions, distance. by applying aqualitative method and conducting 43 in-depth semi-structured interviews, including 22women and 21 men, women and men experiences of distance were investigated based on theirown narratives.the results of the study suggested different forms of distance in couples' relationships,which can be classified to...

The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...