Related papers: Irregular Interval Valued Fuzzy Graphs
We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [16], we classified all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes, or Doob graphs.…
We introduce the class of interval $H$-graphs, which is the generalization of interval graphs, particularly interval bigraphs. For a fixed graph $H$ with vertices $a_1,a_2,\dots,a_k$, we say that an input graph $G$ with given partition…
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower…
Irrational numbers of bounded type have several equivalent characterizations. They have bounded partial quotients in terms of arithmetic characterization and in the dynamics of the circle rotation, the rescaled recurrence time to $r$-ball…
In this paper we deal with a subclass of chordal graphs, which are simultaneously strictly chordal and interval, the strictly interval graphs. We present a new characterization of the class that leads to a simple linear recognition…
Fuzzy anti-norm and corresponding $\alpha$-norms are defined. A few properties of finite dimensional fuzzy anti-normed linear space are studied. Fuzzy $\alpha$-anti-convergence and fuzzy $\alpha$-anti-complete linear space are defined and a…
The adjacency matrices of graphs form a special subset of the set of all integer symmetric matrices. The description of which graphs have all their eigenvalues in the interval [-2,2] (i.e., those having spectral radius at most 2) has been…
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…
Metric graphs are often introduced based on combinatorics, upon "associating" each edge of a graph with an interval; or else, casually "gluing" a collection of intervals at their endpoints in a network-like fashion. Here we propose an…
For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.
We classify all normal edge ideals of edge-weighted graphs.
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
In nature, there are many phenomena with both irregularity and uncertainty. Therefore, a fuzzy-valued fractal interpolation is more useful for modeling them than fuzzy interpolation or fractal interpolation. We construct fractal…
Interval Pairwise Comparison Matrices have been widely used to account for uncertain statements concerning the preferences of decision makers. Several approaches have been proposed in the literature, such as multiplicative and fuzzy…
In this paper, the notion of convexity of picture fuzzy multisets was introduced and some of their properties were presented after studying the concept of picture fuzzy multisets.
The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley…
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 fuzzy observable is regarded as a smearing of a sharp observable, and the structure of covariant fuzzy observables is studied. It is shown that the covariant coarse-grainings of sharp observables are exactly the covariant fuzzy…
We carry out a numerical study of fluctuations in the spectrum of regular graphs. Our experiments indicate that the level spacing distribution of a generic k-regular graph approaches that of the Gaussian Orthogonal Ensemble of random matrix…