Search
نمایش تعداد 1-10 از 268
On the Regular Digraph of Ideals of Commutative Rings
I contains a nonzero divisor on J. In this paper, we study the connectedness
of T(R). We also completely characterise the diameter of this graph and determine the number of edges
in T(R), whenever R is a finite direct product of fields...
Investigation of jet break-up process in diesel engine Spray modelling
The objective of this work is to simulate spray flow with different break-up models and investigate the processes of spray breakup & mixture formation. Effect of these models on the DI diesel engine combustion and performance ...
Effects of exercise intensity on flow mediated dilation in healthy humans
Evaluation of transrectal examination of cervical diameter by palpation in dairy cows
A Generalization of Total Graphs
Let R be a commutative ring with nonzero identity, L_n(R) be the set of all lower triangular nxn matrices, and U be a triangular subset of R^n i.e. the product of any lower triangular matrix with the transpose of any element ...
A new class of Cayley graphs
In this paper, we introduce and study a new class of Cayley graphs.
On the generalization of Cayley graphs of commutative rings
Let R be a commutative ring with unity and R+, U and U∗ be the additive
group, multiplicative prime subset of R and U\\\\{0}. We denote by Cay(R)
the cayley graph Cay(R+,U^*). In this paper, we investigate ...
A Novel Method for Pupil Diameter Measurement based on Fuzzy Techniques
This paper proposes a fuzzy-based algorithm for measurement of the pupil diameter (PD) from the pupil video.The proposed algorithm consists of fourstages: data
acquisition, preprocessing, edge detection, and calculation of PD...
Investigation on Effect of location and Field age on Yield and Frequency of Different Corm Weights of Saffron (Crocus sativus L.)
. There was a positive correlation between corm diameter and corm weight (r2=0. 98)....
On the generalization of Cayley graphs associated to a lattice
Let L be a lattice. For a natural number n we associate a simple graph denoted by T^nL with L^n-{0} as the vertex set and two distinct vertices X and Y begin adjacent if and only if there exists an nxn lower triangular ...