The vertex version of detour index was defined during the works on connected graph in chemistry. The edge versions of detour index have been introduced ecently. In this paper, the explicit relations among edge versions of detour index have been declared and due to these relations, we compute the edge detour indices for some well-known graphs.

For a graph G, let 2(G) denote the minimum degree sum of a pair of nonadjacent vertices. Suppose G is a graph of order n. Enomoto and Ota (J. Graph Theory 34 (2000) 163–169) conjectured that, if a partition n = ∑k i=1 ai is given and 2(G)¿ n + k − 1, then for any k distinct vertices v1; : : : ; vk , G can be decomposed into vertex-disjoint paths P1; : : : ; Pk such that |V (Pi)| = ai and vi is ...

Network science and graph theory are two important branches of mathematics computer science. Many problems in engineering physics modeled with networks graphs. Topological analysis enable researchers to analyse relation some physical properties without conducting expensive experimental studies. indices numerical descriptors which defined by using degree, distance eigen-value notions any graph. ...

A cDNA encoding an Na+-Pi co-transporter, termed rat PiT-1, has now been isolated from rat parathyroid. Expression of rat PiT-1 in Xenopus oocytes revealed that it possesses Na+-dependent Pi co-transport activity. The amount of PiT-1 mRNA in the parathyroid of vitamin D-deficient rats was reduced compared with that in normal animals, and increased markedly after administration of 1,25-dihydroxy...

OBJECTIVES Uterine artery Doppler flow studies during the 11th and 14th week of pregnancy are important in the prediction of preeclampsia and intrauterine growth restriction in pregnant women as well as in the prevention thereof. METHODS Our study on Doppler flow indices of the uterine arteries involved 168 patients examined in our clinic, with pregnancies ranging from 11 weeks + 0 days to 13...

structural codes vis-a-vis structural counts, like polynomials of a molecular graph, areimportant in computing graph-theoretical descriptors which are commonly known astopological indices. these indices are most important for characterizing carbon nanotubes(cnts). in this paper we have computed sadhana index (sd) for phenylenes and theirhexagonal squeezes using structural codes (counts). sadhan...

Resistance to Meloidogyne arenaria race 1 is not currently available in commercial peanut cultivars. Moderate levels of resistance have been identified in Arachis hypogaea plant introductions (PI) in previous greenhouse studies. The purpose of this work was to evaluate the effects of resistance in peanut PI on populations dynamics of M. arenaria in field plots. The PI designated as resistant in...

The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...

Topological indices have been used to modeling biological and chemical properties of molecules in quantitive structure property relationship studies and quantitive structure activity studies. All the degree based topological indices have been defined via classical degree concept. In this paper we define a novel degree concept for a vertex of a simple connected graph: S degree. And also we defin...

1 Formulas Suppose that Y has a multinomial distribution with parameters (p1, . . . , pm). (That is to say, suppose that Pr(Y = i) = pi for an integer i such that 1 ≤ i ≤ m.) Given a sample Y1, . . . , Yn of multinomial random variables with vector parameter (p1, . . . , pm), the maximum–likelihood (and method of moments) estimator of pi is p̂i = #{j : Yj = i}/n = ni/n (1) where ni = #{j : Yj = ...