VARIANCE BALANCED INCOMPLETE BLOCK DESIGNS
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 2
Abstract
This paper provides two new series for the construction for General Efficiency Balanced Incomplete Block Design using the combinatorial arrangement of Efficiency Balanced Incomplete Block Designs.
Authors and Affiliations
Dr. N. Ch. Bhatra Charyulu
Keywords
Related Articles
- EP ID EP531733
- DOI 10.5958/2320-3226.2018.00031.0
- Views 124
- Downloads 0
INDEPENDENT VERIFICATION OF EULER’S FORMULA IN GRAPH THEORY FOR N IDENTICAL CIRCLES
This paper discusses the famous Euler’s formula in graph theory and its independent verification for the case of n identical circles forming a planar graph. A planar connected graph is generated using n circles, and an i...
MODELLING AGE SPECIFIC FERTILITY RATE IN INDIA THROUGH FERTILITY CURVES
One of the important demographic features of any population is the fertility rate which has a direct relationship with both the social and the biological environment.Demographic factors like age at marriage, present fami...
Magneto Hydrodynamic Convective Double Diffusive Fluid Flow Past a Vertical Plate with Varying Temperature and Concentration
This manuscript presents the influence of variable boundary of temperature and concentration of a double diffusive unsteady MHD natural convection heat and mass transfer flow past an accelerated vertical porous plate in...
On Euler-Beta Transform of I-function of two variables
In this paper, the authors establish the Euler-Beta transform of various products involving a General Class of Polynomials, Struve’s function and I-function of two variables. Some similar formulae are also derived as s...
Neighborhood Cordial (Nhd-C) Labeling - A New Method of Graph Labeling
We introduce a new technique of graph labeling named as Neighborhood Cordial (Nhd-C) Labeling of Graphs and show that paths, cycles, FL (Cn), S (C3,n), pathunion Pm(C3), Pm (C4),K1,m: K1,m , TreeYn are nhd-c graphs.