On Euler-Beta Transform of I-function of two variables
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 1
Abstract
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 special cases.
Authors and Affiliations
Dr. Satyanarayana Bavanari
Keywords
Related Articles
- EP ID EP531679
- DOI 10.5958/2320-3226.2018.00017.6
- Views 99
- Downloads 0
Solution of Fuzzy Multi-Objective Fractional Linear Programming Problem Using Fuzzy Programming Technique based on Exponential Membership Function
A method of solving multi-objective fuzzy fractional linear programming problem (MOFFLPP) is presented. All the coefficients of the fractional multi-objective functions and the constraints are taken to be fuzzy numbers....
Reliability Analysis of Six Unit Bridge and Parallel Series Networks With Critical and Non-Critical Human Errors
Humans play a pivotal role in the design, development and operational phases of engineering systems. Reliability evaluation of systems without taking into consideration the human element does not provide a realistic pict...
Some Fixed Point Theorems for Mappings on Complete 〖 S〗_b –Metric Space
In this paper, we prove some common fixed point theorems in S_b-metric space using an increasing function ϕ∶[0,∞)→[0,∞) with lim┬(n→∞)〖ϕ^n (t)=0〗 and ϕ(t)<t for each fixed t>0. Our results extend the result of...
Joule Heating and Radiation Absorption Effects on MHD Convective and Chemically Reactive Flow past a Porous Plate
The aim of this study is to analyze the effects of Joule heating and radiation absorption on MHD convective and chemically reactive flow past an inclined porous plate in the presence of heat source and thermal diffusion....
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.