loading

Category: Volume 25

Einstein constant for almost hyperbolic Hermitian manifold on the product of two Sasakian manifolds

SUSHIL SHUKLA

ABSTRACT:

In 1981, Tsukada worked on the isospectral problem with respect to the complex Laplacian for a two-parameter family of Hermitian structures on the Calabi-Eckmann manifold S2p+1×S2q+1 including the canonical one. In this paper, we define a two-parameter family of almost hyperbolic Hermitian structures on the product manifoldM = M × M’ of a (2p + 1)- dimensional Sasakian manifold M and a (2q + 1)-dimensional Sasakian manifold M’ similarly to the method used in11, and show that any almost hyperbolic Hermitian structure on M belonging to the two parameter family is integrable and again find necessary and sufficient conditionfor a hyperbolic Hermitian manifold in the family to be Einstein

KEYWORDS: Einstein, Hermitian structure, Sasakian manifold


In 1981, Tsukada worked on the isospectral problem with respect to the complex Laplacian for a two-parameter family of Hermitian structures on the Calabi-Eckmann manifold S2p+1×S2q+1 including the canonical one. In this...

Efficient Complementary Perfect Triple Connected Domination Number of a Graph

G. MAHADEVAN1, B. ANITHA2, SELVAM AVADAYAPPAN3 and T. SUBRAMANIAN4

ABSTRACT:

In this paper we introduce new domination parameter called efficient complementary perfect triple connected domination number of a graph. A subset S of V of a nontrivial graph G is said to be an efficient complementary perfect triple connected dominating set, if S is a complementary perfect triple connected dominating set and every vertiex is dominated exactly once. The minimum cardinality taken over all efficient complementary perfect triple connected dominating sets is called the efficient complementary perfect triple connected domination number and is denoted by ecpt. We investigate this number for some standard graphs. We also investigate its relationship with other graph theoretical parameters

KEYWORDS: Complementary perfect triple connected domination number, Efficient complementary perfect triple connected domination number. AMS (2010): 05C69


In this paper we introduce new domination parameter called efficient complementary perfect triple connected domination number of a graph. A subset S of V of a nontrivial graph G is said...

Some generating functions of biorthogonal polynomials suggested by the Laguerre polynomials

K.P. SAMANTA1 and A.K. CHONGDAR2

ABSTRACT:

In this note, we have obtained some novel generating functions(both bilateral and mixed trilateral) involving Konhauser
biorthogonal polynomials by group theoretic method. As special cases, we obtain the corresponding results on generalized
Laguerre polynomials.

KEYWORDS: Laguerre polynomials, biorthogonal polynomials, generating functions. AMS-2000 Subject Classification Code: 33C 47.


In this note, we have obtained some novel generating functions(both bilateral and mixed trilateral) involving Konhauser biorthogonal polynomials by group theoretic method. As special cases, we obtain the corresponding results on...

An inventory model for deteriorating items with weibull deterioration rate, linear demand rate, unit production cost and without shortages

L.K. RAJU1, U.K. MISRA2 and G. MISRA3

ABSTRACT:

The objective of this model is to investigate the inventory system for perishable items with linear demand pattern where Weibull deterioration is considered. The Economic order quantity is determined for minimizing the average total cost per unit time. The unit production cost is taken to be inversely related to the demand rate. The result is illustrated with numerical example.

KEYWORDS: Inventory system, Linear demand, Deterioration, Unit production cost, Shortage


The objective of this model is to investigate the inventory system for perishable items with linear demand pattern where Weibull deterioration is considered. The Economic order quantity is determined...

Finding an Optimal Solution for Transportation Problem– Zero Neighbouring Method

K. THIAGARAJAN1, H.SARAVANAN2 and PONNAMMAL NATARAJAN3

ABSTRACT:

In this paper a different approach namely zero neighbouring method is applied for finding a feasible solution for transportation problems directly. The proposed method is a unique, it gives always feasible (may be optimal for some extent) solution without disturbance of degeneracy condition. This method takes least iterations to reach optimality, compared to the existing methods available in the V. J. Sudhakar et al. Here a numerical example is solved to check the validity of the proposed method and degeneracy problem is also discussed

KEYWORDS: Assignment problem, Transportation problem, Degeneracy, Zero neighbouring method.


In this paper a different approach namely zero neighbouring method is applied for finding a feasible solution for transportation problems directly. The proposed method is a unique, it gives always feasible (may...

The Category L-FCyc

SOURIAR SEBASTIAN1, ALEXANDER MENDEZ2 and DIVYA MARY DAISE.S3

ABSTRACT:

In this paper we introduce L-fuzzy homomorphism of L-fuzzy subgroups of finite cyclic groups through an embedding of lattices. We then form a category whose objects are L-fuzzy subgroups of finite cyclic groups and morphisms are L-fuzzy homomorphisms. We name this category L-FCyc and discuss some of its properties.

KEYWORDS: Category, L-fuzzy subgroups, L-fuzzy homomorphism.


In this paper we introduce L-fuzzy homomorphism of L-fuzzy subgroups of finite cyclic groups through an embedding of lattices. We then form a category whose objects are L-fuzzy subgroups of finite cyclic...

Comparative study of mechanisms and analysis techniques involved in Thermally Stimulated Depolarization and Thermoluminescence Processes

DEVENDRA PRASAD1*, A N THAKUR2 and JAI PRAKASH3

ABSTRACT:

In the present work a comparative study have been done between two thermally stimulated processes, namely Thermally Stimulated Depolarization (TSD) and Thermoluminescence(TL). The depolarization current density or ionic thermocurrent density J depends on the rate of depolarization of IV dipoles and the occurrence TL glow curves are goverened by Adirovitch set of equations. The thermally stimulated spectrums of both the processes are of same nature. In this paper the similarities and counter quantities in both the processes have been discussed. It has also been found that the analysis technique, for determination of dielectric relaxation parameters, decay parameters and order of kinetics, are also similar for both processes.

KEYWORDS: Thermally stimulated depolarization, Thermoluminescence, Dielectric relaxation parameters, TL decay parameters, Order of kinetics


In the present work a comparative study have been done between two thermally stimulated processes, namely Thermally Stimulated Depolarization (TSD) and Thermoluminescence(TL). The depolarization current density or ionic thermocurrent density J depends on...

Application of vertex and group magic labeling

K. KAVITHA1 and K.THIRUSANGU2

ABSTRACT:

Graph labeling is a currently emerging area in the research of graph theory. A graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions. If the labels of edges are distinct positive integers and for each vertex v the sum of the labels of all edges incident with v is the same for every vertex v in the given graph, then the labeling of the graph is called magic labeling. There are several types of magic labeling defined on graphs. In this paper we consider vertex magic labeling and group magic labeling of graphs as an application of magic labeling. We solve a problem of finding number of computers/workstations to be allocated to each department in a company under certain conditions

KEYWORDS: vertex magic labeling, group magic labeling, Z-magic labeling. AMS Subject Classification: 05C78


Graph labeling is a currently emerging area in the research of graph theory. A graph labeling is an assignment of integers to the vertices or edges or both subject to certain...

Graceful labelling of arbitrary Supersubdivision of disconnected graph

C. SEKAR1 and V. RAMACHANDRAN2

ABSTRACT:

In this paper we prove that arbitrary Supersubdivision of disconnected graph is graceful.

KEYWORDS: Graceful labelling, Supersubdivision of graphs, disconnected graphs. AMS Subject Classification (2010):05C78


In this paper we prove that arbitrary Supersubdivision of disconnected graph is graceful.

Z4p- Magic labeling for some more special graphs

V.L. STELLA ARPUTHA MARY1, S. NAVANEETHAKRISHNAN2 and A. NAGARAJAN3

ABSTRACT:

For any non-trivial abelian group A, a graph G is said to be A-magic if there exists a labeling f of the edges of G with non zero elements of A such that the vertex labeling f + defned as f +(v) = Σf(uv) taken over all edges uv incident at v is a constant4. A graph is said to be A-magic if it admits A- magic labeling. In this paper we consider (moduloZ4,+) as abelian group and we prove Z4 – magic labeling for various graphs and generalize Z4p -magic labeling for those graphs. The graphs which admit Z4p-magic labeling are called as Z4p-magic graphs.

KEYWORDS: A - magic labeling, Z4 - magic labeling, Z4pmagic labeling, Z4p-magic graphs Mathematics Subject Classifcation 2000:05C78


For any non-trivial abelian group A, a graph G is said to be A-magic if there exists a labeling f of the edges of G with non zero elements of A...