In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...

The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...

In this paper, we discuss the existence and uniqueness of fixed points for $G$-asymptotic contractions in metric spaces endowed with a graph. The result given here is a new version of Kirk's fixed point theorem for asymptotic contractions in metric spaces endowed with a graph. The given result here is a generalization of fixed point theorem for asymptotic contraction from metric s paces to metr...

Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...

In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph $G$ with minimum degree $delta ge2$. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we ...

in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.

let $n$ be any positive integer and let $f_n$ be the friendship (or dutch windmill) graph with $2n+1$ vertices and $3n$ edges. here we study graphs with the same adjacency spectrum as the $f_n$. two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. let $g$ be a graph cospectral with $f_n$. here we prove that if $g$ has no cycle of length $4$ or $...

let $n$ be any positive integer, the friendship graph $f_n$ consists of $n$ edge-disjoint triangles that all of them meeting in one vertex. a graph $g$ is called cospectral with a graph $h$ if their adjacency matrices have the same eigenvalues. recently in href{http://arxiv.org/pdf/1310.6529v1.pdf}{http://arxiv.org/pdf/1310.6529v1.pdf} it is proved that if $g$ is any graph cospectral with $f_n$...

let $r$ be a commutative ring with identity and $mathbb{a}(r)$ be the set   of ideals of $r$ with non-zero annihilators. in this paper, we first introduce and investigate the principal ideal subgraph of the annihilating-ideal graph of $r$, denoted by $mathbb{ag}_p(r)$. it is a (undirected) graph with vertices $mathbb{a}_p(r)=mathbb{a}(r)cap mathbb{p}(r)setminus {(0)}$, where   $mathbb{p}(r)$ is...

In this paper we introduce and study a graph on the set of ideals of a commutative ring $R$. The vertices of this graph are non-trivial ideals of $R$ and two distinct ideals $I$ and $J$ are adjacent if and only $IJ=Icap J$. We obtain some properties of this graph and study its relation to the structure of $R$.