Papers

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.

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.

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

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

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.

A set S of vertices of a graph G is a total neighborhood set of G if G is the union of the subgraphs induced by the closed neighborhoods of the vertices in S and for every vertex uV there exists a vertex v S such that u is adjacent to v. The total neighborhood number nt(G) of G is the minimum cardinality of a total neighborhood set of G. A total neighborhood nomatic partition of G is a partition {V1, V2, ..., Vk} of V in which each Vi is a total neighborhood set of G. The total neighborhood nomatic number ntn(G) of G is the maximum order of a partition of the vertex set of G into total neighborhood sets. In this paper, we obtain results about two parameters, the total neighborhood number and total
neighborhood nomatic number.

Encircled Energy Factor (EEF), Excluded Energy and Relative Encircled Energy are important corollaries of the Point Spread Function (PSF) of an optical system. In this paper, we have studied the Excluded Energy, Relative Encircled energy to understand their role as Point Image quality assessment parameters of Optical systems with amplitude apodised rotational symmetric filter functions

The purpose of this paper is to introduce and study the concepts of intuitionistic fuzzy almost regular weakly generalized open mappings, intuitionistic fuzzy almost regular weakly generalized closed mappings and almost contra regular weakly generalized continuous mappings in intuitionistic fuzzy topological space and we investigate some of its properties. Also we provide the relations between intuitionistic fuzzy almost regular weakly generalized closed mappings and other intuitionistic fuzzy closed mappings.

Many decisions involve multiple stages of choices and events. In this paper to develops fuzzy dynamic system approach for solving multistage decision-making problems. Fuzzy dynamic system is a promising tool for dealing with multistage decision-making and optimization problems under fuzziness. The cases of deterministic, stochastic, fuzzy dynamic system, fuzzy criterion set dynamic programming, fuzzy termination time’s are analyzed. Lastly, summarize the main results of the computational complexity.

Prime labeling originated with Entringer and was introduced by Tout, Dabboucy and Howalla4. A Graph G(V,E) is said to have a prime labeling if its vertices are labeled with distinct integers 1,2,3,…,V(G) such that for each edge xy the labels assigned to x and y are relatively prime. A graph admits a prime labeling is called a prime graph. In this
paper, we prove that (PnS2)k, (PnS3)k and Cn  Sm are prime graphs.