Related papers: *-Balanced Fuzzy graphs
In this paper, we define the Mycielskian of a signed graph and discuss the properties of balance and switching in the Mycielskian of a given signed graph. We provide a condition for ensuring the Mycielskian of a balanced signed graph…
Fuzzy circular interval graphs are a generalization of proper circular arc graphs and have been recently introduced by Chudnovsky and Seymour as a fundamental subclass of claw-free graphs. In this paper, we provide a polynomial-time…
We present a graph theory-based method to characterise flow defects and structural shifts in condensed matter. We explore the connection between dynamical properties, particularly the recently introduced concept of ''softness'', and…
Graphs with bounded thinness were defined in 2007 as a generalization of interval graphs. In this paper we introduce the concept of proper thinness, such that graphs with bounded proper thinness generalize proper interval graphs. We study…
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…
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…
Given a graph $G = (V,E)$ with vertex weights $w(v)$ and a desired number of parts $k$, the goal in graph partitioning problems is to partition the vertex set V into parts $V_1,\ldots,V_k$. Metrics for compactness, contiguity, and balance…
In this paper, a new concept in graphs namely well-f-coveredness is introduced. We characterize all graphs with such property, whose maximum induced forests are of boundary order. Also we prove several propositions concerning with obtaining…
In this paper, we propose Continuous Graph Flow, a generative continuous flow based method that aims to model complex distributions of graph-structured data. Once learned, the model can be applied to an arbitrary graph, defining a…
The purpose of this paper is to investigate some properties of fuzzy ideals and fuzzy bi-ideals in gamma-semigroups and to introduce the notion of fuzzy quasi ideals in gamma-semigroups. Here we also characterize a regular gamma-semigroup…
Motivated by performance optimization of large-scale graph processing systems that distribute the graph across multiple machines, we consider the balanced graph partitioning problem. Compared to the previous work, we study the…
We introduce a technique called graph fission which takes in a graph which potentially contains only one observation per node (whose distribution lies in a known class) and produces two (or more) independent graphs with the same node/edge…
Two-sample tests utilizing a similarity graph on observations are useful for high-dimensional and non-Euclidean data due to their flexibility and good performance under a wide range of alternatives. Existing works mainly focused on sparse…
A new class of fuzzy closed sets, namely fuzzy weakly closed set in a fuzzy topological space is introduced and it is established that this class of fuzzy closed sets lies between fuzzy closed sets and fuzzy generalized closed sets.…
The enormous amount of data to be represented using large graphs exceeds in some cases the resources of a conventional computer. Edges in particular can take up a considerable amount of memory as compared to the number of nodes. However,…
We introduce the fuzzy supersphere as sequence of finite-dimensional, noncommutative $Z_{2}$-graded algebras tending in a suitable limit to a dense subalgebra of the $Z_{2}$-graded algebra of ${\cal H}^{\infty}$-functions on the $(2|…
In this paper defuzzification method of WABL is investigated, its properties are analyzed. The WABL method is applied to some fuzzy models. The package of applied programs is worked out on the base of proposed algorithms. The obtained in…
A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.
Tangles were originally introduced as a concept to formalize regions of high connectivity in graphs. In recent years, they have also been discovered as a link between structural graph theory and data science: when interpreting similarity in…
The transitivity of fuzzy relations plays an important role in fuzzy set theory, artificial intelligence, clustering and decision-making. However, it is often difficult for fuzzy relations to satisfy the transitivity property in many…