Related papers: Soft Rough Graphs
A graph is a mathematical object consisting of a set of vertices and a set of edges connecting vertices. Graphs can be drawn on paper in various ways, but until recently all published methods of drawing graphs have had undesirable…
We show that in supersymmetric theories, knowing the soft theorem for a single particle in a supermultiplet allows one to immediately determine soft theorems for the remainder of the supermultiplet. While soft theorems in supersymmetric…
Graph theory has successfully used to solve a wide range of problems encountered in diverse fields such as medical sciences, neural networks, control theory, transportation, clustering analysis, expert systems, image capturing, and network…
Continuum soft robots are mechanical systems entirely made of continuously deformable elements. This design solution aims to bring robots closer to invertebrate animals and soft appendices of vertebrate animals (e.g., an elephant's trunk, a…
This paper introduces semiopen and semiclosed soft sets in soft topological spaces. The notions of interior and closure are generalized using these sets. A detail study is carried out on properties of semiopen, semiclosed soft sets, semi…
We firstly present definitions and properties in study of Maji \cite{maji-2013} on neutrosophic soft sets. We then give a few notes on his study. Next, based on \c{C}a\u{g}man \cite{cagman-2014}, we redefine the notion of neutrosophic soft…
This book presents a comprehensive and systematic survey of graph theory under uncertainty, with particular emphasis on the unifying role of the uncertain graph framework. It reviews fundamental concepts, structural properties, graph…
The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…
In this paper we present a new concept called generalized neutrosophic soft set. This concept incorporates the beneficial properties of both generalized neutrosophic set introduced by A.A. Salama [7]and soft set techniques proposed by…
Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections. In the…
In this study, the soft usual topology compatible with the usual topology of $\mathbb{R}$ is defined, and using its subspace topology on the interval $[0,1]$, the concept of a soft path is introduced. Within this context, the notions of…
We introduce and study, for a process P delivering edges on the Cartesian product of the vertex sets of a given set of graphs, the P-product of these graphs, thereby generalizing many types of product graph. Analogous to the notion of a…
Real-world phenomena often exhibit vagueness, partial truth, and incomplete information. To model such uncertainty in a mathematically rigorous way, many generalized set-theoretic frameworks have been introduced, including Fuzzy Sets [1],…
Daily internet communication relies heavily on tree-structured graphs, embodied by popular data formats such as XML and JSON. However, many recent generative (probabilistic) models utilize neural networks to learn a probability distribution…
\emph{Uncertain Graph} (also known as \emph{Probabilistic Graph}) is a generic model to represent many real\mbox{-}world networks from social to biological. In recent times analysis and mining of uncertain graphs have drawn significant…
In this paper, we introduce the concept of several products of rough finite state machines. We establish their relationships through coverings and investigate some algebraic properties for these products.
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
In this paper, we define normal soft int-groups and derive their some basic properties. We also investigate some relations on {\alpha}-inclusion, soft product and normal soft int-groups. Then we define normalizer, quotient group and give…
This paper deals with computation trees over an arbitrary structure consisting of a set along with collections of functions and predicates that are defined on it. It is devoted to the comparative analysis of three parameters of problems…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…