Session 1 | 22 December 2020 | Day 3
Chairperson
Dr. Britto
Head, Department of Mathematics
Sacred Heart College, Tirupattur, Tamil Nadu, India
SOME PROPERTIES OF k- GAUSS HYPERGEOMETRIC FUNCTION
Shruti Dang,�Ekta Mittal�and�Sunil Joshi
21
Presenter Name
Sunil Joshi
The object of this paper is to develop the transformations of the k-hypergeometric function of the type , which has been converted in to know results. Further we also establish the k-gauss theorem and k-gauss hypergeometric equation with its solutions
FRACTIONAL ORDER DERIVATIVE OF MITTAG-LEFFLER FACTORIAL FUNCTION AND ITS SUMS
Jaraldpushparaj S and Britto Antony Xavier
25
Presenter Name
JARALDPUSHPARAJ S
This research aims to find the fractional order derivative of generalized Mittag-Leffler Factorial Function (MLFF). The Generalized Mittag-Leffler factorial function is obtained by replacing polynomials into polynomial factorials in the expression of Mittag-Leffler Function. The Special case of this MLFF is the Extorial function. This function is used to solve the certain type of fractional difference equation and it has some applications in the field of Discrete Fractional Calculus.
A Study On Slope Number And Domatic Number On Certain Classes Of Cayley Graphs
Amutha and Antony Mary
65
Presenter Name
A. Antony Mary
Designing of interconnection network plays an important in modelling large scale parallel architectures. Some notable interconnection networks are cayley graphs. There has been a spurt of research on cayley graphs as it has gained importance for the past few years that are suitable for designing interconnection networks. Motivated by this, we would like to investigate our research on slope number and domatic number on cayley graphs. Here, the slope number is about minimizing the slopes and domatic number is about partitioning the vertices into dominating sets. The main objective of this paper is to present characterization theorem on certain classes of cayley graphs. We consider cayley graphs such as complete graph, crown graph and circulant graph for analysis and the paper is divided into three sections. In the first section, we examine the slope number for these graphs. In the second section, we observed results on domatic number. Finally we provide relationship between slope number and domatic number based on the characterization that satisfies equality condition.
PROPERTIES OF J-IDEALS IN POSETS
J.Catherine Grace John and Elavarasan B
82
Presenter Name
DR.J.CATHERINE GRACE JOHN
In this paper, we study and establish some interesting results of J-ideals in posets. Characterization of prime ideals to be J-ideals and the equivalent conditions for an ideal to be J-ideal of P are obtained. Finally the separation theorem for J-ideal is also discussed.
On nano preregular ?-open sets
J.B. Toranagatti
87
Presenter Name
Dr.J.B.Toranagatti
The aim of this paper is to introduce a new class of sets called nano preregular ?-open sets in nano topological spaces. Some properties and characterizations of the said type of sets are investigated. Also, a new class of nano continuity called np?- continuity is introduced.
MAXIMUM MATCHING IN VARIOUS OPEN PATH FRACTAL GRAPHS
Tharaniya P and Jayalalitha G
20
Presenter Name
P.Tharaniya
The aim of this chapter gives more valuable information about many Fractal Graphs. It analyses the structure, implementation of vertices, Edges and angles of Fractal Graph for all Iteration. It finds out the implementation of Vertices and Edges for all Iteration follows the Constant Formulae in the Fractal Graphs. This chapter finds that in which common formulae is applied for the implementation of vertices and Edges in the Fractal Graph like Von Koch Curve (which has even number of edges in each iteration), Sierpenski Arrow Head Curve (which has odd number of edges in each iteration). Matching is one of the very important and more scope topic in Graph Theory. Calculation of Maximum Matching is one of the major evaluations in this chapter. In this chapter separates Fractal Graph into two parts like Open Walk Fractal Graph and Closed Walk Fractal Graph. This paper finds the new common formulae for calculating Matching cardinality which depends on the total number of vertices and total number of edges in the corresponding Iteration of the given Fractal Graph. Here check and examine whether the derived formulae is suitable in some of the Open Path Fractal Graph like Von Koch Curve and Sierpenski Arrow Head Curve. This paper conclude that this derived formulae can be implemented to all Open Path Fractal Graphs. Calculation of Maximum Matching can be determined by using Iterative Methods.
On Statistical third Quartile method for IBFS of TP and comparison with NWC and LC Method
Ashok Bhadane and Shrinath Manjarekar
22
Presenter Name
Ashok Parasharam Bhadane
In this paper, we have developed a new method through statistical third quartile process to find out the initial basic feasible solution of the given transportation problem and compare it with Least Cost Method / minimum cell cost method as well as North � West Corner method and shown that the statistical third quartile method is best as compare to least cost and North � West Corner method.
FRACTIONAL ORDER DERIVATIVE OF EXTORIAL FUNCTION
Sathinathan T and Britto Antony Xavier
26
Presenter Name
SATHINATHAN T
This research aims to find the fractional order derivative of Extorial Function. The Extorial function is obtained by replacing polynomials into polynomial factorials in the exponential function. This function is used to solve the fractional order difference equations by using the inverse of higher order difference operator.