Related papers: Interval-valued fuzzy graphs
A complex intuitionistic fuzzy Lie superalgebra is a generalization of intuitionistic fuzzy Lie super-algebra whose membership function takes values in the unit disk in the complex plane. In [4], we introduced and studied the concepts of…
In this note, we introduce the concept of factored lift, associated with a combined voltage graph, as a generalization of the lift graph. We present a new method for computing the eigenvalues and eigenspaces of factored lifts.
We study the properties of certain graphs involving the sums of primes. Their structure largely turns out to relate to the distribution of prime gaps and can be roughly seen in Cram\'er's model as well. We also discuss generalizations to…
A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…
The novelty of this paper is to construct the explicit combinatorial formula for the number of all distinct fuzzy matrices of finite order, which leads us to invent a new sequence. In order to achieve this new sequence, we analyze the…
The study of fuzzy fractional variational problems in terms of a fractional Liouville-Caputo derivative is introduced. Necessary optimality conditions for problems of the fuzzy fractional calculus of variations with free end-points are…
We describe the missing class of the hierarchy of mixed unit interval graphs, generated by the intersection graphs of closed, open and one type of half-open intervals of the real line. This class lies strictly between unit interval graphs…
We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
The bounds on the sum and product of chromatic numbers of a graph and its complement are known as Nordhaus-Gaddum inequalities. In this paper, we study the operations on the Independence numbers of graphs with their complement. We also…
In this paper, the concept of a picture fuzzy subgroup of a group is studied, and the notion of the direct product of picture fuzzy subgroups is introduced. Several characterisations of the direct product of picture fuzzy subgroups are…
We introduce and study, for a process P delivering edges on the Cartesian product of the vertex sets of a given set of graphs, the P-product of these graphs, thereby generalizing many types of product graph. Analogous to the notion of a…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
In this paper, we introduce a flip operation on self-complementary ideals of chain product posets and study the resulting flip graphs. We give asymptotics for the number of vertices in these graphs, compute their diameters, and give bounds…
Rosenfeld defined a fuzzy subgroup of group $G$ as a fuzzy subset of $G$ with two special conditions attached\cite{Rosenfeld1971Fuzzysubgroups}. In this paper, we introduce the fuzzy $t$-norms and vague $t$-norms. The unit interval with a…
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…
Given a connected graph $G$, the total mutual-visibility number of $G$, denoted $\mu_t(G)$, is the cardinality of a largest set $S\subseteq V(G)$ such that for every pair of vertices $x,y\in V(G)$ there is a shortest $x,y$-path whose…
Bigraphs and their algebra is a model of concurrency. Fuzzy bigraphs are a generalization of birgraphs intended to be a model of concurrency that incorporates vagueness. More specifically, this model assumes that agents are similar,…
We define the Cartesian, Categorical, and Lexicographic, and Strong products of quantum graphs. We provide bounds on the quantum chromatic number of these products in terms of the quantum chromatic number of the factors. To adequately…
For a graph consisting of parallel connected subgraphs we express the characteristic function of the boundary value problem with generalized Neumann conditions at both joining points via characteristic functions of different boundary…