Objective- To measure statistically bone cortex to diameter  (C/D) ratio in metocarpo/metatarsal and proximal phalanges in camel. This ratio may be used in diagnosing possible metabolic and nutritional diseases in camel. Design- Experimental study. Animals- Twelve camel limbs (6 fore limbs & 6 hind limbs)      Procedures- This study was conducted on dorsopalmar/dorsoplantar radiographs of t...

A generalized p-cycle is a digraph whose set of vertices is partitioned in p parts that can bc ordered in such a way that a vertex is adjacent only to vertices in the next part. The families of B G C ( p , d , d ' ) and KGC(p ,d ,d "~ + d ' ) are the largest known p-cycles for their degree and diameter. [n this paper we present a lower bound for the fault-diameter of a generalized cycle. Then w...

For designing reliable and efficient communications networks, the problem of constructing a maximally connected d-regular digraph (directed graph) with a small diameter is investigated. A maximally connected d-regular digraph with a diameter at most two larger than the lower bound for any number of nodes n > 2d and any d > 3 is constructed. Since the diameter of this digraph is quasiminimal (at...

Objective - The aim of this study was to measure the ratio of bone cortex (C) to bone diameter (D), (C/D) in radius/tibia, metacarpus /metatarsus and proximal phalanges in fore and hindlimbs to be used as a diagnostic guide in metabolic and nutritional diseases in Minature Donkey. Design- Experimental study Animals- Eight adult Minature donkeys. Procedures- Lateromedial, dorsopalmar and dors...

In 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest value f(d) such that every 2-edge-connected graph G with diameter d has an orientation with diameter at most f(d). For d = 3, their general bounds reduce to 8 ≤ f(3) ≤ 24. We improve these bounds to 9 ≤ f(3) ≤ 11.

Any defects in street trees may cause injuries to human, vehicles and buildings. This research was investigated in the Babol city, Mazandaran province, in the northern state of Iran.Used the perfect inventory methods and measured the diameter at breathe height (DBH), height and hazardous criteria (dead woods, cracks or seams, decay, wound or cankers, root problems, weak branch unions and skew f...

Any defects in street trees may cause injuries to human, vehicles and buildings. This research was investigated in the Babol city, Mazandaran province, in the northern state of Iran.Used the perfect inventory methods and measured the diameter at breathe height (DBH), height and hazardous criteria (dead woods, cracks or seams, decay, wound or cankers, root problems, weak branch unions and skew f...

Let $n(k, d)$ be the order of largest undirected graphs maximum degree $k$ and diameter $d$, let $M(k,d)$ corresponding Moore bound. In this paper, we give a positive answer to question Bermond Bollob\'as concerning Degree/Diameter Problem: Given integer $c>0$, does there exist pair such that d)\leq M(k,d)-c?$

The diameter of a graph G is the maximal distance between two vertices of G. A graph G is said to be diameter-edge-invariant, if d(G−e) = d(G) for all its edges, diametervertex-invariant, if d(G − v) = d(G) for all its vertices and diameter-adding-invariant if d(G+ e) = d(e) for all edges of the complement of the edge set of G. This paper describes some properties of such graphs and gives sever...