Related papers: Irregular Interval Valued Fuzzy Graphs
The vertices of an interval graph represent intervals over a real line where overlapping intervals denote that their corresponding vertices are adjacent. This implies that the vertices are measurable by a metric and there exists a linear…
Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders. The question about the conditions under…
An r-partite graph is an interval r-graph if corresponding to each vertex we can assign an interval of the real line such that two vertices u and v of different partite sets are adjacent if and only if their corresponding intervals…
In this paper we introduce the notion of interval valued hesitant fuzzy soft topological space. Also the concepts of interval valued hesitant fuzzy soft closure, interior and neighbourhood are introduced here and established some important…
This article is meant to give a lucid and widely accessible, self-contained account of a novel way of performing arithmetic operations on fuzzy intervals. Based on two formulae of generalized inversion (the first in close analogy to the…
In this Paper we defined the improved concept of fuzzy magic Graph as the set of two injective functions defined on [0; 1] such that sum of the labeled defined on vertices greater than respective edge label while sum of two vertices and…
We consider nonregular graphs having precisely three distinct eigenvalues. The focus is mainly on the case of graphs having two distinct valencies and our results include constructions of new examples, structure theorems, valency…
Random fuzzy variables join the modeling of the impreciseness (due to their ``fuzzy part'') and randomness. Statistical samples of such objects are widely used, and their direct, numerically effective generation is therefore necessary.…
Intersection graphs are very important in both theoretical as well as application point of view. Depending on the geometrical representation, different type of intersection graphs are defined. Among them interval, circular-arc, permutation,…
Given a reference lattice, we define fuzzy intervals to be the fuzzy sets such that their p-cuts are crisp closed intervals. We show that: given a complete reference lattice, the collection of its fuzzy intervals is a complete lattice.…
The sigma index of a graph, defined as the population variance of its degree sequence, is a fundamental measure of structural irregularity. In this paper, we introduce and systematically investigate its natural extension to fuzzy graphs,…
In this paper, we give a characterization of distance matrices of distance-regular graphs to be invertible.
In the process of measuring objects with local self-similarity, such as satellite images or coastlines, we obtain a data set with both local self-similarity and uncertainty. To better interpolate such data sets, an interpolation function…
Let $F$ and $G$ be simple finite undirected graphs. A graph $G$ is called $F$-irregular if any two of its distinct vertices belong to different numbers of copies of $F$ in $G$. According to the strong conjecture about $F$-irregular graphs…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than…
This survey concerns regular graphs that are extremal with respect to the number of independent sets, and more generally, graph homomorphisms. More precisely, in the family of of $d$-regular graphs, which graph $G$ maximizes/minimizes the…
A $p$-improper interval graph is an interval graph that has an interval representation in which no interval contains more than $p$ other intervals. A critical $p$-improper interval graph is $p-1$ improper when any vertex is removed. In this…
We consider isomorphism of controllable graphs and cospectrality of distance-regularized graphs (which are known to be distance-regular or distance-biregular) in relation to logical definability. While most characterizations of these…
In this paper we consider certain types of betweenness axioms on the interval function $I_G$ of a connected graph $G$. We characterize the class of graphs for which $I_G$ satisfy these axioms. The class of graphs that we characterize…