Related papers: *-Balanced Fuzzy graphs
For every pair of vertices u and v with d(u; v) = n, Wun G v denotes the set of all vertices of G that are closer to u than to v. In this paper, we introduce quasi-({\lambda}; n)-distance-balanced graphs and then study some properties of…
A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…
There are several centrality measures that have been introduced and studied for real world networks. They account for the different vertex characteristics that permit them to be ranked in order of importance in the network. Betweenness…
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…
We present a new metric of link cohesion for measuring the strength of edges in complex, highly connected graphs. Link cohesion accounts for local small hop connections and associated node degrees and can be used to support edge scoring and…
Fuzzy numbers are commonly represented with fuzzy sets. Their objective is to better represent imprecise data. However, operations on fuzzy numbers are not as straightforward as maths on crisp numbers. Commonly, the Zadeh's extension rule…
We consider approximately greater than relations on fuzzy sets and discuss their properties.
Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea applied to graphs. In order to understand expressive power and…
Fuzzy quantification is a subtopic of fuzzy logic which deals with the modelling of the quantified expressions we can find in natural language. Fuzzy quantifiers have been successfully applied in several fields like fuzzy, control, fuzzy…
Uncertain graphs are prevalent in several applications including communications systems, biological databases and social networks. The ever increasing size of the underlying data renders both graph storage and query processing extremely…
Recent advances in dynamic graph processing have enabled the analysis of highly dynamic graphs with change at rates as high as millions of edge changes per second. Solutions in this domain, however, have been demonstrated only for…
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a…
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.
Let $H$ be a graph on $n$ vertices and let the blow-up graph $G[H]$ be defined as follows. We replace each vertex $v_i$ of $H$ by a cluster $A_i$ and connect some pairs of vertices of $A_i$ and $A_j$ if $(v_i,v_j)$ was an edge of the graph…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…
A powerful framework for studying graphs is to consider them as geometric graphs: nodes are randomly sampled from an underlying metric space, and any pair of nodes is connected if their distance is less than a specified neighborhood radius.…
In this paper we introduce some families of fuzzy L-systems and investigate their properties. We further discuss the relationship between fuzzy L languages and the fuzzy languages generated by fuzzy grammar proposed in Ref.[3,5]. A measure…
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],…
Testable weighted graph parameters and equivalent notions of testability are investigated based on papers of Laszlo Lovasz and coauthors. We prove that certain balanced minimum multiway cut densities are testable. Using this fact, quadratic…