Related papers: *-Balanced Fuzzy graphs
Mining dense quasi-cliques is a well-known clustering task with applications ranging from social networks over collaboration graphs to document analysis. Recent work has extended this task to multiple graphs; i.e. the goal is to find groups…
In this manuscript a unified framework for conducting inference on complex aggregated data in high dimensional settings is proposed. The data are assumed to be a collection of multiple non-Gaussian realizations with underlying undirected…
Real-world graphs can be difficult to interpret and visualize beyond a certain size. To address this issue, graph summarization aims to simplify and shrink a graph, while maintaining its high-level structure and characteristics. Most…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…
Fuzzy incidence graphs (FIG) model real world problems efficiently when there is an extra attribute of vertex-edge relationship. The article discusses the operations on Fuzzy incidence graphs. The join, Cartesian product, tensor product,…
The purpose of this paper is to introduce different types of operations on fuzzy ideals of $\Gamma$-semirings and to prove subsequently that these oprations give rise to different structures such as complete lattice, modular lattice on some…
Structural balance theory assumes triads in networks to gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are often directed, we introduce a novel method for considering…
We develop a kind of pregeometry consisting of a web of overlapping fuzzy lumps which interact with each other. The individual lumps are understood as certain closely entangled subgraphs (cliques) in a dynamically evolving network which, in…
Mixed connectivity is a generalization of vertex and edge connectivity. A graph is $(p,0)$-connected, $p>0$, if the graph remains connected after removal of any $p-1$ vertices. A graph is $(p,q)$-connected, $p\geq 0$, $q>0$, if it remains…
Graphs are commonly used in mathematics to represent some relationships between items. However, as simple objects, they sometimes fail to capture all relevant aspects of real-world data. To address this problem, we generalize them and model…
In this paper, a survey about recent progress on problems solved using graph amalgamations is presented, along with some new results with complete proofs, and some related open problems.
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
In this work, topological spaces are enriched by additional structures in order to give a more realistic representation of real life phenomena and computational processes and at the same time, to provide for utilization of the powerful…
This paper presents a formal definition of stability for node centrality measures in weighted graphs. It is shown that the commonly used measures of degree, closeness and eigenvector centrality are stable whereas betweenness centrality is…
In this paper, rough approximations of Cayley graphs are studied and rough edge Cayley graphs are introduced. Furthermore, a new algebraic definition called pseudo-Cayley graphs containing Cayley graphs is proposed. Rough approximation is…
In this work we propose a formal system for fuzzy algebraic reasoning. The sequent calculus we define is based on two kinds of propositions, capturing equality and existence of terms as members of a fuzzy set. We provide a sound semantics…
This note attempts to understand graph limits as defined by Lovasz and Szegedy (2006)} in terms of harmonic analysis on semigroups. This is done by representing probability distributions of random exchangeable graphs as mixtures of…
Theory of operators generated by binary fuzzy relations is highly increasing for its nature and applicability. The main goal of the paper is to present several representation theorems for operators induced by fuzzy relations (for example…
We introduce the concept of indexed identity, where the usual notion of identity is a particular case. Our mathematical framework allows us a generalized method for `indexing' predicates, which corresponds to `fuzzification' of properties,…
The aim of the paper is to address the behavior in large population of diffusions interacting on a random, possibly diluted and inhomogeneous graph. This is the natural continuation of a previous work, where the homogeneous Erd\H os-R\'enyi…