Related papers: *-Balanced Fuzzy graphs
An architecture of a new neuro-fuzzy system is proposed. The basic idea of this approach is to tune both synaptic weights and membership functions with the help of the supervised learning and self-learning paradigms. The approach to solving…
In a graph $A$, the measure $|M_g^A(f)|=m_g^A(f)$ for each arbitrary edge $f=gh$ counts the edges in $A$ closer to $g$ than $h$. $A$ is termed an edge quasi-$\lambda$-distance-balanced graph in a metric space (abbreviated as $EQDBG$), where…
A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…
Graph-structured data arise naturally in many different application domains. By representing data as graphs, we can capture entities (i.e., nodes) as well as their relationships (i.e., edges) with each other. Many useful insights can be…
Statistical convergence was introduced in connection with problems of series summation. The main idea of the statistical convergence of a sequence l is that the majority of elements from l converge and we do not care what is going on with…
The practice of stochastic sensitivity analysis described in the decision analysis literature is a testimonial to the need for considering deviations from precise point estimates of uncertainty. We propose the use of Bayesian fuzzy…
Large-scale graphs are widely used to represent object relationships in many real world applications. The occurrence of large-scale graphs presents significant computational challenges to process, analyze, and extract information. Graph…
Using the spectral theory of weakly convergent sequences of finite graphs, we prove the uniform existence of the integrated density of states for a large class of infinite graphs.
This paper presents an empirical study of the relationship between the density of small-medium sized random graphs and their planarity. It is well known that, when the number of vertices tends to infinite, there is a sharp transition…
We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts of a graph, we concentrate on the structure of edges…
This study addresses the issue of balancing graph summarization and graph change detection. Graph summarization compresses large-scale graphs into a smaller scale. However, the question remains: To what extent should the original graph be…
We study the problem of half-domination sets of vertices in vertex transitive infinite graphs generated by regular or semi-regular tessellations of the plane. In some cases, the results obtained are sharp and in the rest, we show upper…
The notion of "balance" is fundamental for sociologists who study social networks. In formal mathematical terms, it concerns the distribution of triad configurations in actual networks compared to random networks of the same edge density.…
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…
In this paper, the fuzzy Hausdorff distance is studied, and also the fuzzy equidistant set for two points of a fuzzy metric space is introduced. Here, the fuzzy metric space has been redefined using recently developed fuzzy geometry, and…
The blow-up of a graph is obtained by replacing every vertex with a finite collection of copies so that the copies of two vertices are adjacent if and only if the originals are. If every vertex is replaced with the same number of copies,…
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.…
The paper addresses the graph classification problem and introduces a modification of the lazy associative classification method to efficiently handle intersections of graphs. Graph intersections are approximated with all common subgraphs…
The paper starts from the observation on the complexity of the manipulation of fuzzy processes that increases very rapidly with the extents of the processes representation. Therefore, a productive approach is to divide the problem into…
An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into \emph{bundles}. Each edge can participate in many such bundles. Any crossing in this bundled graph occurs between…