Given an undirected graph G = (V,E), two distinguished vertices s and t of G, and a diameter bound D, a D-s, t-path is a path between s and t composed of at most D edges. An edge e or vertex u are called Dirrelevant if e or u does not belong to anyD-s, t-path ofG. In this paper we study the problem of efficiently detecting D-irrelevant edges and vertices and also study the computational complex...

Double pulsed-field gradient (d-PFG) MRI can provide quantitative maps of microstructural quantities and features within porous media and tissues. We propose and describe a novel MRI phantom, consisting of wafers of highly ordered glass capillary arrays (GCA), and its use to validate and calibrate a d-PFG MRI method to measure and map the local pore diameter. Specifically, we employ d-PFG Spin-...

The Klee-Quaife problem is finding the minimum order μ(d, c, v) of the (d, c, v) graph, which is a c-vertex connected v-regular graph with diameter d. Many authors contributed finding μ(d, c, v) and they also enumerated and classified the graphs in several cases. This problem is naturally extended to the case of digraphs. So we are interested in the extended Klee-Quaife problem. In this paper, ...

This study evaluated the consistency of manual and automated measurements of monodominant follicle diameter with different follicle size in infertile patients. Transvaginal two-dimensional (2D) ultrasound and SonoAVC (Sonography-based Automated Volume Calculation) were both performed in 226 infertile patients with monodominant follicle growth. 2D diameters were separately compared with SonoAVC-...

The identification of diametrical vertices in the d-dimensional hypercube (d >/3) leads to a (0, 2)-graph of degree d on 2 d1 vertices and of diameter [. d/2 J namely the extended odd graph (or Laborde-Mulder graph) for odd values of d, and the half-cube for even values of d. In this paper we prove that the diameter of a (0, 2)-graph of degree d on 2 ~~ vertices is at least [. d/2 .~ and when d...

The nonexistence of digraphs with order equal to the Moore bound Md;k = 1+d+: : :+d k for d; k > 1 has lead to the study of the problem of the existence ofàlmost' Moore digraphs, namely digraphs with order close to the Moore bound. In 1], it was shown that almost Moore digraphs of order Md;k ? 1, degree d, diameter k (d; k 3) contain either no cycle of length k or exactly one such cycle. In thi...

to determine the droplet characteristics of agricultural spray nozzles through water sensitive paper (wsp), the non-circular and overlapped spots appearing on the water sensitive paper surfaces are eliminated. in the conventional approach, the procedure is done according to the subjective self determined estimation of the operator. the objective of this study was to develop a practical alternat...

The degree/diameter problem for directed graphs is the problem of determining the largest possible order for a digraph with given maximum outdegree d and diameter k. An upper bound is given by the Moore bound M(d, k) = ∑k i=0 d i and almost Moore digraphs are digraphs with maximum out-degree d, diameter k and order M(d, k)− 1. In this paper we will look at the structure of subdigraphs of almost...

Gladiolus (Gladiolus grandiflorus L.), a popular bulbous cut flower, has high demand in both domestic (Pakistani) as well as international markets. Five potential, exotic cultivars of gladiolus, ‘Cantate’, ‘Corveira’, ‘Eminence’, ‘Essential’ and ‘Fado’ were evaluated to determine the cultivar effects on yield and quality, to compare their relative performance and recommend their suitability for...

We propose a general model for testing graph properties, which extends and simpliies the bounded degree model of GR97]. In this model we present a family of algorithms that test whether the diameter of a graph is bounded by a given parameter D, or is-far from any graph with diameter at most (D). The function (D) ranges between D + 4 and 4D + 2, depending on the algorithm. All our algorithms run...