Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G)  V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...

Given a random walk on a graph, the cover time is the rst time (number of steps) that every vertex has been hit (covered) by the walk. Deene the marking time for the walk as follows. When the walk reaches vertex vi, a coin is ipped and with probability pi the vertex is marked (or colored). We study the time that every vertex is marked. (When all the pi's are equal to 1, this gives the usual cov...

Abstract. Given a random walk on a graph, the cover time is the rst time (number of steps) that every vertex has been hit (covered) by the walk. De ne the marking time for the walk as follows. When the walk reaches vertex vi, a coin is ipped and with probability pi the vertex is marked (or colored). We study the time that every vertex is marked. (When all the pi's are equal to 1, this gives the...

We consider the following problem, which is called the half integral parity disjoint paths packing problem. Input: A graph G, k pair of vertices (s1, t1), (s2, t2), . . . , (sk, tk) in G (which are sometimes called terminals), and a parity li for each i with 1 ≤ i ≤ k, where li = 0 or 1. Output : Paths P1, . . . , Pk in G such that Pi joins si and ti for i = 1, 2, . . . , k and parity of length...

the wiener index w(g) of a connected graph g is defined as the sum of the distances betweenall unordered pairs of vertices of g. the eccentricity of a vertex v in g is the distance to avertex farthest from v. in this paper we obtain the wiener index of a graph in terms ofeccentricities. further we extend these results to the self-centered graphs.

objective: an association between poor oral health and chronic lung disease has recently been reported. the purpose of this study was to explore this potential association between asthma and periodontal disease. materials and methods: this is a descriptive case controlled study. the samples were selected from patients referred to respiratory disease clinic in a hospital in tehran, iran. the stu...

An extension of the basic image reconstruction problem in discrete tomography is considered: given a graph G = (V, E) and a family P of chains Pi together with vectors h(Pi) = (h 1 i , ..., h k i ), one wants to find a partition V , ..., V k of V such that for each Pi and each color j, |V ∩Pi| = hji . An interpretation in terms of scheduling is presented. We consider special cases of graphs and...

A masking level difference (MLD) paradigm was used to investigate the presence of an electrophysiologic correlate of the psychoacoustic MLD in the middle and late auditory evoked potentials. In experiment 1, middle latency potentials were recorded in six normal-hearing young adults using vertex and temporal electrode montages. Tone bursts of 500 Hz presented in SoNo and Spi No conditions produc...

Topological indices are numerical parameters of a graph which characterize its topology. In this paper the PI, Szeged and Zagreb group indices of the tetrameric 1,3–adamantane are computed.