Papers by Priscilla Pacifica
International Journal of Mathematics Trends and Technology, Jan 31, 2023
International Journal of Mathematical Archive, Sep 1, 2015
In this paper we introduce a new class of sets called (gsp)**-closed sets in topological spaceswh... more In this paper we introduce a new class of sets called (gsp)**-closed sets in topological spaceswhich is properly placed in between the class of closed sets and gsp-closed sets. As an application, we introduce two new spaces namely, * * space, * * space. Further, (gsp)**-continuous, (gsp)**-irresolute mappings are also introduced and investigated.
International Journal of Mathematical Archive, Sep 1, 2015
In this paper we introduce a new class of sets called pg**-closed sets in topological spaces whic... more In this paper we introduce a new class of sets called pg**-closed sets in topological spaces which is properly placed in between the class of closed sets and gsp-closed sets. As an application, we introduce new spaces namely, p 1 2 ⁄ * *-space, *-space, * 1 2 ⁄ *-space, 1 2 ⁄ * *-space and p *-space. Further, pg**-continuous, pg**-irresolute mappings are also introduced and investigated.
Indian journal of science and technology, Jan 5, 2023
Objectives: To find the connected restrained detour number for standard graphs and mesh graphs. M... more Objectives: To find the connected restrained detour number for standard graphs and mesh graphs. Methods: By determining the connected restrained detour set with minimum cardinality, the connected restrained detour number of a graph is investigated. Findings: We study that the connected restrained detour number of the graphs is altered when we add pendent vertices. The minimum and maximum degree vertices of a graph are deleted and the connected restrained detour number of the mesh graph is computed. Novelty: Finding the detour path plays a vital role in the network-based systems. Planning the largest route that is connected and restrained is essential in business, industries and radio technologies. We introduce the new concept of connected restrained detour number. We also exhibit the bounds for the connected restrained detour set of a graph.
International Journal of Mathematics Trends and Technology, Feb 25, 2019
International journal of scientific research in mathematical and statistical sciences, Aug 31, 2018
The concept of bitopological space was first introduced by J.C.Kelly in 1963 (i.e) a non-empty se... more The concept of bitopological space was first introduced by J.C.Kelly in 1963 (i.e) a non-empty set equipped with two arbitrary topologies and .The concept of generalized closed sets plays a significant role in general topology and these are the research topics of many Topologists worldwide.In 1970 Norman Levine introduced the concept of generalization of closed sets in topological spaces and he defined the semi-open sets and semi-continuity in bitopological spaces. In this paper we introduce a new class of generalized closed sets namely (i,j)-closed sets in bitopological spaces ()a subset of a bitopological space () is called ()-closed if-() ,whenever , is-open in () and some of the properties were discussed. The class of (i,j)-closed sets settled in between the class of (i,j)-closed sets and the class of (i,j)-gs-closed sets.Some of the basic properties of (i,j)-closed sets are investigated.
International Journal of Mathematics Trends and Technology, Mar 25, 2018
The concept of derivation in incline algebra was introduced by N.O.Alsherhi[1]. Kyung Ho kim and ... more The concept of derivation in incline algebra was introduced by N.O.Alsherhi[1]. Kyung Ho kim and so Young Park[2] introduced the symmetric bi-f-derivation in incline algebra. In this paper, we introduce the concept of symmetric bit derivation in incline algebras and present some properties of symmetric bi-tderivations. Also, we characterize () and () by symmetric bit derivations in incline algebra and give some examples. Also we define isotone symmetric bit derivation in incline algebra and analyse its properties.
Advances in Mathematics, Jul 4, 2020
For a connected graph G = (V,E) and u, v any two vertices in G, a u − v path P is said to be a u ... more For a connected graph G = (V,E) and u, v any two vertices in G, a u − v path P is said to be a u − v triangle free path if no three vertices of P induce a cycle C3 in G. The triangle free detour distance D∆f (u, v) is the length of a longest u − v triangle free path in G. A u − v triangle free path of length D∆f (u, v) is called the u− v triangle free detour. In this article, the concept of total triangle free detour number of a graph G is introduced. It is found that the total triangle free detour number differs from triangle free detour number and connected triangle free detour number. The total triangle free detour number is found for some standard graphs. Their bounds are determined. Certain general properties satisfied by them are studied.
CRC Press eBooks, Aug 4, 2023
International Journal of Engineering and Advanced Technology, 2020
In this article we define Steiner and upper Steiner distances in connected fuzzy graphs by combin... more In this article we define Steiner and upper Steiner distances in connected fuzzy graphs by combining the notion of Steiner distance with distance and proved that both are metric. Also based on length, eccentricity, radius, diameter, diametric vertex, eccentric vertex, centre, convexity, self-centred graphs are introduced for both Steiner and upper Steiner distances . Some common characteristic properties are analysed and relation between Steiner and upper Steiner distances are discussed with an application. A model result is given for transport network.2010 AMS Classification: 05C72, 05C12
International Journal of Mathematics Trends and Technology, Jan 31, 2023
Indian Journal Of Science And Technology
Objectives: To find the connected restrained detour number for standard graphs and mesh graphs. M... more Objectives: To find the connected restrained detour number for standard graphs and mesh graphs. Methods: By determining the connected restrained detour set with minimum cardinality, the connected restrained detour number of a graph is investigated. Findings: We study that the connected restrained detour number of the graphs is altered when we add pendent vertices. The minimum and maximum degree vertices of a graph are deleted and the connected restrained detour number of the mesh graph is computed. Novelty: Finding the detour path plays a vital role in the network-based systems. Planning the largest route that is connected and restrained is essential in business, industries and radio technologies. We introduce the new concept of connected restrained detour number. We also exhibit the bounds for the connected restrained detour set of a graph.
International Journal of Mathematics Trends and Technology, 2019
The purpose of this paper is to introduce the concept of generalized closed set to penta topologi... more The purpose of this paper is to introduce the concept of generalized closed set to penta topological space. Further we studied some fundamental properties of penta topological space.
For a connected graph G = (V,E) of order at least two, a total triangle free detour set of a grap... more For a connected graph G = (V,E) of order at least two, a total triangle free detour set of a graph G is a triangle free detour set S such that the subgraph G[S] induced by S has no isolated vertices. The minimum cardinality of a total triangle free detour set of G is the total triangle free detour number of G. It is denoted by 〖tdn〗_Δf (G). A total triangle free detour set of cardinality 〖tdn〗_Δf (G) is called 〖tdn〗_Δf- set of G. In this article, the concept of upper total triangle free detour number of a graph G is introduced. It is found that the upper total triangle free detour number differs from total triangle free detour number. The upper total triangle free detour number is found for some standard graphs. Their bounds are determined. Certain general properties satisfied by them are studied.
International Journal of Mathematics Trends and Technology, 2018
The concept of derivation in incline algebra was introduced by N.O.Alsherhi[1]. Kyung Ho kim and ... more The concept of derivation in incline algebra was introduced by N.O.Alsherhi[1]. Kyung Ho kim and so Young Park[2] introduced the symmetric bi-f-derivation in incline algebra. In this paper, we introduce the concept of symmetric bit derivation in incline algebras and present some properties of symmetric bi-tderivations. Also, we characterize () and () by symmetric bit derivations in incline algebra and give some examples. Also we define isotone symmetric bit derivation in incline algebra and analyse its properties.
International Journal of Mathematical Archive EISSN 2229-5046, Apr 2, 2017
I n this paper the separation axioms via pg ** -open sets are analysed in topological and ideal t... more I n this paper the separation axioms via pg ** -open sets are analysed in topological and ideal topological spaces.
International Journal of Mathematics Trends and Technology, Feb 25, 2014
I n this paper we introduce a new class of sets called (gsp)**-closed sets in topological spacesw... more I n this paper we introduce a new class of sets called (gsp)**-closed sets in topological spaceswhich is properly placed in between the class of closed sets and gsp-closed sets. As an application, we introduce two new spaces namely, space, space. Further, (gsp)**-continuous, (gsp)**-irresolute mappings are also introduced and investigated.
Uploads
Papers by Priscilla Pacifica