Related papers: Irregular Interval Valued Fuzzy Graphs
Crisp and $L$-fuzzy ambiguous representations of closed subsets of one space by closed subsets of another space are introduced. It is shown that, for each pair of compact Hausdorff spaces, the set of (crisp or $L$-fuzzy) ambiguous…
In a paired threshold graph, each vertex has a weight, and two vertices are adjacent if their weight sum is large enough and their weight difference is small enough. It generalizes threshold graphs and unit interval graphs, both very well…
The concept of interval-valued fuzzy soft $\beta$-covering approximation spaces (IFS$\beta$CASs) is introduced to combine the theories of soft sets, rough sets and interval-valued fuzzy sets, and some fundamental propositions concerning…
Recently, Wang et al. discussed the properties of fuzzy information systems under homomorphisms in the paper [C. Wang, D. Chen, L. Zhu, Homomorphisms between fuzzy information systems, Applied Mathematics Letters 22 (2009) 1045-1050], where…
A detailed study of graded frame, graded fuzzy topological system and fuzzy topological space with graded inclusion is already done in our earlier paper. The notions of graded fuzzy topological system and fuzzy topological space with graded…
This paper considers a new fuzzy fractional differential variational inequality with integral boundary conditions comprising a fuzzy fractional differential inclusion with integral boundary conditions and a variational inequality in…
The starting point of this paper is the introduction of a new measure of inclusion of fuzzy set A in fuzzy set B. Previously used inclusion measures take values in the interval [0,1]; the inclusion measure proposed here takes values in a…
We initiate the study of a new parameterization of graph problems. In a multiple interval representation of a graph, each vertex is associated to at least one interval of the real line, with an edge between two vertices if and only if an…
We develop a formalism to address statistical pattern recognition of graph valued data. Of particular interest is the case of all graphs having the same number of uniquely labeled vertices. When the vertex labels are latent, such graphs are…
We introduce and study a mathematical framework for a broad class of regularization functionals for ill-posed inverse problems: Regularization Graphs. Regularization graphs allow to construct functionals using as building blocks linear…
Irregularly sampling a spatially stationary random field does not yield a graph stationary signal in general. Based on this observation, we build a definition of graph stationarity based on intrinsic stationarity, a less restrictive…
We consider unitary graphs attached to Z_d^n using an analogue of the Euclidean distance. These graphs are shown to be integral when n is odd or the dimension d is even.
Crisp and lattice-valued ambiguous representations of one continuous semilattice in another one are introduced and operation of taking pseudo-inverse of the above relations is defined. It is shown that continuous semilattices and their…
From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior. For morphic superword we prove periodicity of Rauzy schemes.…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
A connected graph $\G$ is called {\em nicely distance--balanced}, whenever there exists a positive integer $\gamma=\gamma(\G)$, such that for any two adjacent vertices $u,v$ of $\G$ there are exactly $\gamma$ vertices of $\G$ which are…
We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs,…
We define a graph structure associated in a natural way to finite fields that nevertheless distinguishes between different models of isomorphic fields.
Conceptual Graphs (CG) are a graph-based knowledge representation and reasoning formalism; fuzzy Conceptual Graphs (fCG) constitute an extension that enriches their expressiveness, exploiting the fuzzy set theory so as to relax their…
In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.