APAV - Academy of Sciences, Letters, Arts and Technology (E-Journals)
Not a member yet
757 research outputs found
Sort by
Some Operations on Complex Fuzzy Graphs
In this paper we discussed about some types of complex fuzzygraphs which is the extension of fuzzy graph. As the membershipvalue of elements of fuzzy graph is in between 0 and 1. In complexfuzzy graph it will be extended to unit circle of complex plane. Someoperations such as union, intersection, composition, cartesian productof two complex fuzzy graphs are introduced. Some basic theoremswith respect to the above mentioned operations are proved with examples
Transit in corona product of graphs
The transit of a vertex is ``the sum of the lengths of all shortest path with as an internal vertex'' and the transit index of a graph is the sum of the transit of all the vertices of it. In this paper we investigate transit of vertices in Corona product of graphs. An expression for transit of vertices in , where and are arbitrary is derived. We also compute transit for vertices in , in the case where is a path, a cycle, a star, a complete graph and a complete bipartite graph
Am I Too Pixelated?
In 2003, Nick Bostrom published his highly influential “Simulation Argument” in Philosophical Quarterly(Bostrom, 2003), an idea taken so seriously that even Bank of America has sent out alerts to its clients. But what, exactly, would that mean? And, more importantly, why is the idea of a simulated universe not being pursued in regard to cancer—and every other disease? We understand, in magnificently precise, granular ways, exactly what is going wrong in the body. But do we understand, in a coarser way, what the granules are made of? In a holographic universe, the images we perceive are not necessarily what they appear to be; they might exist against a background. But the background would create a context that participates in the image that emerges. Green can be rendered as green. Or as “blue yellow blue” or “yellow blue yellow.” Perhaps the act of rendering generates variables that have been overlooked in our understanding of illness: scale and spin
Detour Global Domination for Degree Splitting graphs of some graphs
In this paper, we introduced the new concept detour global domination number for degree splitting graph of standard graphs. The detour global dominating sets in some standard and special graphs are determined. First we recollect the concept of degree splitting graph of a graph and we produce some results based on the detour global domination number of degree splitting graph of star graph, bistar graph, complete bipartite graph, complete graph path graph, cycle graph, wheel graph and helm graph. A set S is called a detour global dominating set of G if S is both detour and global dominating set of G. The detour global domination number is the minimum cardinality of a detour global dominating set in G
Micro Sp-Open Sets in Micro Topological Spaces
In this paper, a new class of open sets called Micro Sp- Open sets in Micro topological spaces are introduced and its fundamental properties are analyzed. Also, some operations on Micro Sp-open sets are investigated
Some fixed point results using (ψ, φ)-generalized almost weakly contractive maps in S-metric spaces
In this paper, we define - generalized almost weakly contractive maps in S-metric spaces and prove an existence and uniqueness of a fixed point to such maps. We also given an example to support of our result
Equitable eccentric domination in graphs
In this paper, we define equitable eccentric domination in graphs. An eccentric dominating set S ⊆ V (G) of a graph G(V, E) is called an equitable eccentric dominating set if for every v ∈ V − S there exist at least one vertex u ∈ V such that |d(v) − d(u)| ≤ 1 where vu ∈ E(G). We find equitable eccentric domination number γeqed(G) for most popular known graphs. Theorems related to γeqed(G) have been stated and proved
Bi-amalgamated algebra with (n; p)-weakly clean like properties
Let f : A −→ B and g : A −→ C be two ring homomorphisms and let K and K′ be two ideals of B and C, respectively such that f −1(K) = g−1(K′). In this paper, we give a characterization for the bi-amalgamation of A with (B, C) along (K, K′) with respect to (f, g) (denoted by A ▷◁f,g (K, K′)) to be a (n, p)-weakly clean ring
Forecasting of Annual Rainfall using Fuzzy Logic Interval Based Partitioning in Different Intervals
Fuzzy time series models have been proposed by many researchers around the world for rainfall forecasting, but the forecasting has not been as accurate as existing methods. Frequency density or ratio-based segmentation methods have been used to represent discourse segmentation. In this paper, to make such predictions, we used interval-based segmentation as the discourse segmentation and the urban mean rainfall in the Trichy district as the discourse universe. Fuzzy models are used for forecasting in many fields such as admissions prediction, stock price analysis, agricultural production, horticultural production, marine production, weather forecasting, and more
Weighted Norlund-Euler Statistical Convergence In Neutrosophic Normed Linear Spaces
This paper explores the neutrosophic Norlund I-statistically conver[1]gent sequence space. In Norlund convergent spaces, we introduce some neutrosophic normed spaces (NNSs). The topological and al[1]gebraic characteristics of these convergent sequence spaces are also examined. The NNS theory technique is used to prove theorems. Results are gathered from many angles, and fresh instances are cre[1]ated to support the equivalents and show the validity of the new ideas. The findings of this study provide a thorough foundation for NNS and significantly advance the literature’s theoretical understanding of the phenomenon. This study’s distinguishing characteristic is the first comprehensive analysis of the properties and use of neutrosophic Norlund I-statistically convergent sequences in NNS, based on the accepted definition