Related papers: New Horizons On Fuzzy Magic Graph
An \emph{antimagic labeling} of a finite undirected simple graph with $m$ edges and $n$ vertices is a bijection from the set of edges to the integers $1,...,m$ such that all $n$ vertex sums are pairwise distinct, where a vertex sum is the…
A graph is distance magic if it admits a bijective labeling of its vertices by integers from $1$ up to the order of the graph in such a way that the sum of the labels of all the neighbors of a vertex is independent of a given vertex. We…
We show that sums over graphs such as appear in the theory of Feynman diagrams can be seen as integrals over discrete groupoids. From this point of view, basic combinatorial formulas of the theory of Feynman diagrams can be interpreted as…
For a positive integer $n$, let $\mZ$ be the set of all non-negative integers modulo $n$ and $\sP(\mZ)$ be its power set. A modular sumset valuation or a modular sumset labeling of a given graph $G$ is an injective function $f:V(G) \to…
This paper initiates the study of picture fuzzy topological spaces. In order to develop a mechanism to construct picture fuzzy topological spaces, we prove some basic results related to picture fuzzy sets together with the introduction of…
Frank Harary introduced the concept of integral sum graph. A graph $G$ is an \emph{ integral sum graph} if its vertices can be labeled with distinct integers so that $e = uv$ is an edge of $G$ if and only if the sum of the labels on…
A fuzzy circle and a fuzzy 3-sphere are constructed as subspaces of fuzzy complex projective spaces, of complex dimension one and three, by modifying the Laplacians on the latter so as to give unwanted states large eigenvalues. This leaves…
In this paper we define fuzzy sequential topology on a non empty set X which is a collection of fuzzy sequential sets satisfying certain conditions given in its definition and many pleasant properties of a countable number of fuzzy…
We consider the task of drawing a graph on multiple horizontal layers, where each node is assigned a layer, and each edge connects nodes of different layers. Known algorithms determine the orders of nodes on each layer to minimize crossings…
The main objective of this paper is to develop a new semantic Network structure, based on the fuzzy sets theory, used in Artificial Intelligent system in order to provide effective on-line assistance to users of new technological systems.…
Let $G=(V,E)$ be an $n$-vertex graph with $m$ edges. A function $f : V \cup E \rightarrow \{1, \ldots, n+m\}$ is an edge-magic labeling of $G$ if $f$ is bijective and, for some integer $k$, we have $f(u)+f(v)+f(uv) = k$ for every edge $uv…
This paper introduces a novel topology, referred to as the star topology, on finite graphs. By treating vertices and edges as points in a unified space, we explore continuous maps between Bare representations of a graph and their…
We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a graph. The graphs constructed here all satisfy a lower…
The O(N) symmetric vector model is considered on both ordinary and fuzzy sphere. It is shown that in both cases master fields exist and their explicit forms are presented. They are found to mix the internal symmetry and the (fuzzy)…
Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…
This paper aims to present objective methods for constructing new fuzzy sets from known fuzzy or classical sets, defined over the elements of a finite universe's superstructure. The paper proposes rules for assigning membership functions to…
Statistical limits are defined relaxing conditions on conventional convergence. The main idea of the statistical convergence of a sequence l is that the majority of elements from l converge and we do not care what is going on with other…
This article studies a generalization of magic squares to $k$-uniform hypergraphs. In traditional magic squares the entries come from the natural numbers. A magic labeling of the vertices in a graph or hypergraph has since been generalized…
In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).
We give some inclusion relations for arbitrary fuzzy sets with reference to famous inequalities. In particular, we can know that the bounded sum and the algebraic product go well together. We would like to propose the concept of `Fuzzy Set…