Related papers: Irregular Interval Valued Fuzzy Graphs
A vertebrate interval graph is an interval graph in which the maximum size of a set of independent vertices equals the number of maximal cliques. For any fixed $v \ge 1$, there is a polynomial-time algorithm for deciding whether a…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
A few of the algebraic and topological properties of int. fuzzy continuity and int. fuzzy uniform continuity are investigated. Also, the concept of int. fuzzy uniform convergence is introduced thereafter a few result on int. fuzzy uniform…
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…
In this paper extremal values of the difference between several graph invariants related to the metric dimension are studied: mixed metric dimension, edge metric dimension and strong metric dimension. These non-trivial extremal values are…
An $n$-vertex graph whose degree set consists of exactly $n-1$ elements is called antiregular graph. Such type of graphs are usually considered opposite to the regular graphs. An irregularity measure ($IM$) of a connected graph $G$ is a…
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…
We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…
Limits and colimits of diagrams, defined by maps between sets, are universal constructions fundamental in different mathematical domains and key concepts in theoretical computer science. Its importance in semantic modeling is described by…
Fuzzy implication functions have been widely investigated, both in theoretical and practical fields. The aim of this work is to continue previous works related to fuzzy implications constructed by means of non necessarily associative…
We define interval spacing as the difference in the order statistics of data over a gap of some width. We derive its density, expected value, and variance for uniform, exponential, and logistic variates. We show that interval spacing is…
Graph matrices are a type of matrix which has played a crucial role in analyzing the sum of squares hierarchy on average case problems. However, except for rough norm bounds, little is known about graph matrices. In this paper, we take a…
In this paper, we give tight bounds for the normalized Laplacian eigenvalues of hypergraphs that are not necessarily uniform, and provide an edge version interlacing theorem, a Cheeger inequality, and a discrepancy inequality that are…
The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply restrictions on the 2-interval graphs, and justify…
In this paper, we introduce a new type fuzzy boundary and study some related set theoretic identities. Further, this new type of fuzzy boundary is compared with different existing fuzzy boundaries.
We consider approximately greater than relations on fuzzy sets and discuss their properties.
An ordinal-valued metric taking its values in the set of all countable ordinals can be assigned to a metrizable set of nodes in a transfinite graph. Then, a variety of results concerning nodal eccentricities, radii, diameters, centers,…
We introduce the concept of distance ideals of graphs, which can be regarded as a generalization of the Smith normal form and the spectra of the distance matrix of a graph. We obtain a classification of the graphs with at most one trivial…
In multi-attribute decision-making problems where the attribute values are interval grey numbers, a simplified form based on kernels and the degree of greyness is presented. Combining fuzzy graph theory with the kernel and the degree of…
An interval $k$-graph is the intersection graph of a family $\mathcal{I}$ of intervals of the real line partitioned into at most $k$ classes with vertices adjacent if and only if their corresponding intervals intersect and belong to…