Observations of the southern Cepheid ℓ Car to yield the mean angular diameter and angular pulsation amplitude have been made with the Sydney University Stellar In-terferometer (SUSI) at a wavelength of 696 nm. The resulting mean limb-darkened angular diameter is 2.990±0.017 mas (i.e. ±0.6 per cent) with a maximum-to-minimum amplitude of 0.560±0.018 mas corresponding to 18.7±0.6 per cent in the ...

accurately localizing the mental foramen and mandibular canal is important when administering local anesthesia and performing surgery; therefore, knowing the normal range of the possible locations is essential. our purpose was to assess the location of the mental foramen and mandibular canal in an iranian population using panoramic radiography.standard panoramic radiographies were performed. th...

For n ∈ N and D ⊆ N, the distance graph P n has vertex set {0, 1, . . . , n− 1} and edge set {ij | 0 ≤ i, j ≤ n − 1, |j − i| ∈ D}. The class of distance graphs generalizes the important and very well-studied class of circulant graphs which have been proposed for numerous network applications. In view of fault tolerance and delay issues in these applications, the connectivity and diameter of cir...

objective: this paper tries to analyse and visualize the co-authorship network of institutions in 1351 papers published in 7 knowledge and information science journals in iran from 1387 through 1391.methodology: in this paper, we use scientometric and social network analysis to study the collaboration network of institutions. overall structure of the network was investigated using a few macro-l...

We bound the mean distance in a connected graph which is not a tree in function of its order n and its girth g. On one hand, we show that mean distance is at most n+1 3 − g(g−4) 12n(n−1) if g is even and at most n+1 3 − g(g−1) 12n(n−1) if g is odd. On the other hand, we prove that mean distance is at least ng 4(n−1) unless G is an odd cycle.

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 ...

In this paper a particular computer interconnection network, the symmetric chordal ring network of degree four, is presented, and the mapping of meshes and binary trees onto chordal ring networks is analysed. Expressions for the network diameter (the maximum distance a message must travel between any pair of computers) and the mean inter-computer distance are derived for a sub-set of chordal ri...