Related papers: New Horizons On Fuzzy Magic Graph
Medical image classification requires not only high predictive performance but also interpretability to ensure clinical trust and adoption. Graph Neural Networks (GNNs) offer a powerful framework for modeling relational structures within…
We investigate the Dots and Boxes game, also known as ``Strings and Coins,'' for certain specific families of graphs. These include complete graphs, wheel graphs, and friendship graphs.
We consider the problem where a set of individuals has to classify $m$ objects into $p$ categories and does so by aggregating the individual classifications. We show that if $m\geq 3$, $m\geq p\geq 2$, and classifications are fuzzy, that…
A simple $n$-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with the integers $1, 2, 3,\ldots, n$ such that adjacent vertices have relatively prime labels. We will present previously unknown prime vertex…
The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph which was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced. In this paper we study the F-index of four…
In this paper, we generalize image (texture) statistical descriptors and propose algorithms that improve their efficacy. Recently, a new method showed how the popular Co-Occurrence Matrix (COM) can be modified into a fuzzy version (FCOM)…
Fuzzy spaces are obtained by quantizing adjoint orbits of compact semi-simple Lie groups. Fuzzy spheres emerge from quantizing S^2 and are associated with the group SU(2) in this manner. They are useful for regularizing quantum field…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
A matrix algebra is constructed which consists of the necessary degrees of freedom for a finite approximation to the algebra of functions on the family of orthogonal Grassmannians of real dimension 2N, known as complex quadrics. These…
In this study, we introduce the Fuzzy Additive Model (FAM) and FAM with Explainability (FAME) as a solution for Explainable Artificial Intelligence (XAI). The family consists of three layers: (1) a Projection Layer that compresses the input…
We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…
Theories defined in higher than four dimensions have been used in various frameworks and have a long and interesting history. Here we review certain attempts, developed over the last years, towards the construction of unified particle…
This paper further studies the fuzzy rough sets based on fuzzy coverings. We first present the notions of the lower and upper approximation operators based on fuzzy coverings and derive their basic properties. To facilitate the computation…
Fuzzy closure spaces are an extension of classical closure spaces in topology, where the concept of closure is defined in terms of fuzzy sets. This article introduces interior operators and neighborhood systems in fuzzy closure spaces.…
In this article, we describe the fuzzy logic, fuzzy language and algorithms as the basis of fuzzy reasoning, one of the intelligent information processing method, and then describe the general fuzzy reasoning method.
We introduce the idea of an n-simplex graph and games upon simplicial complexes. We then define moves on a labeled graph and pose the problem of whether given two labelings of a graph it is possible to change one into another via these…
In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply…
We define and investigate a new three-parameter family of graphs that further generalizes the Fibonacci and metallic cubes. Namely, the number of vertices in this family of graphs satisfies Horadam recurrence, a linear recurrence of second…
One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After "normalization," a sum of products has a natural graphical representation, called a normal…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…