Related papers: Isometry on Interval-valued Fuzzy Graphs
In this paper, a new interval type-2 fuzzy neural network able to construct non-separable fuzzy rules with adaptive shapes is introduced. To reflect the uncertainty, the shape of fuzzy sets considered to be uncertain. Therefore, a new form…
Intuitionistic fuzzy Banach algebra is introduced and a few properties of it is studied. The properties of invertible elements and relation among invertible elements, open set, closed set are emphasized. Topological divisors of zero is…
A mixed graph has a set of vertices, a set of undirected egdes, and a set of directed arcs. A proper coloring of a mixed graph $G$ is a function $c$ that assigns to each vertex in $G$ a positive integer such that, for each edge $uv$ in $G$,…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…
The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability…
Graphs are nowadays ubiquitous in the fields of signal processing and machine learning. As a tool used to express relationships between objects, graphs can be deployed to various ends: I) clustering of vertices, II) semi-supervised…
A \emph{mixed interval graph} is an interval graph that has, for every pair of intersecting intervals, either an arc (directed arbitrarily) or an (undirected) edge. We are particularly interested in scenarios where edges and arcs are…
A proper edge-coloring of a graph is an interval coloring if the labels on the edges incident to any vertex form an interval of consecutive integers. Interval thickness s(G) of a graph G is the smallest number of interval colorable graphs…
Fuzzy optimization deals with the problem of determining 'optimal'solutions of an optimization problem when some of the elements that appear in the problem are not precise. In real situations it is usual to have information, in systems…
Graph embedding is a transformation of vertices of a graph into set of vectors. Good embeddings should capture the graph topology, vertex-to-vertex relationship, and other relevant information about graphs, subgraphs, and vertices. If these…
The domatic number of a graph is the maximum number of vertex disjoint dominating sets that partition the vertex set of the graph. In this paper we consider the fractional variant of this notion. Graphs with fractional domatic number 1 are…
In this paper we introduce the notion of interval valued hesitant fuzzy soft topological space. Also the concepts of interval valued hesitant fuzzy soft closure, interior and neighbourhood are introduced here and established some important…
We give a geometrically motivated measure of skewness, define a mean value triangle number, and dispersion (in that order) of a fuzzy number without reference or seeking analogy to the namesake but parallel concepts in probability theory.…
Graphs are quickly emerging as a leading abstraction for the representation of data. One important application domain originates from an emerging discipline called "connectomics". Connectomics studies the brain as a graph; vertices…
Fuzzy clustering algorithms can be roughly categorized into two main groups: Fuzzy C-Means (FCM) based methods and mixture model based methods. However, for almost all existing FCM based methods, how to automatically selecting proper…
An interval t-coloring of a graph G is a proper edge-coloring of G with colors 1,2,...,t such that at least one edge of G is colored by i, i=1,2,...,t, and the edges incident to each vertex v\in V(G) are colored by d_{G}(v) consecutive…
Graph matching is the process of computing the similarity between two graphs. Depending on the requirement, it can be exact or inexact. Exact graph matching requires a strict correspondence between nodes of two graphs, whereas inexact…
The graph isomorphism problem is a main problem which has numerous applications in different fields. Thus, finding an efficient and easy to implement method to discriminate non-isomorphic graphs is valuable. In this paper, a new method is…
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
This article provides structural characterization of simple graphs whose edge-set can be partitioned into maximum matchings. We use Vizing's classification of simple graphs based on edge chromatic index.