The emergence of cooperation in social dilemmas has been addressed in a number of fields. In this paper, we illustrate how robust cooperation can emerge among a population of agents participating in a N-player dilemma when the agents are spatially arranged on a graph exhibiting small world properties. We present a graph structure with a high level of community structure, small diameter and a va...

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 textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$‎. ‎In this case‎, ‎$B$ is called a textit{metric basis} for $G$‎. ‎The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$‎. ‎Givi...

The idea of graph compositions generalizes both ordinary compositions of positive integers and partitions of finite sets. In this paper we develop formulas, generating functions, and recurrence relations for composition counting functions for several families of graphs.

Every symmetric matrix has an invertible principal submatrix whose rank is equal to that of the whole matrix. We explore some of the implications of this result for graph spectra. U sing the same symbol for a graph and its adjacency matrix, we say that a graph G is A-invertible if G AI is invertible, and the A-rank of G is the rank of G AI. A A-basic subgraph of G is an induced A-invertible sub...

We reconsider basic algorithmic graph problems in a setting where an n-vertex input graph is read-only and the computation must take place in a working memory of O(n) bits or little more than that. For computing connected components and performing breadth-first search, we match the running times of standard algorithms that have no memory restrictions, for depth-first search and related problems...

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...

collaboration networks are the basis of development of social knowledge domains. a co-authorship network includes a set of people connected to each other because of their cooperation in publication of articles and thus create a huge graph.this study has analyzed co-authorship papers of civilica, islamic world science citation center (isc), scientific information database (sid) and science direc...

This paper presents research on enabling cooperative decision strategies in a distributed sensor network. The paper begins with an introduction to distributed sensor networks and outlines two levels of cooperation: implicit and explicit cooperation. Implicit cooperation is the process of building and maintaining a common distributed picture where explicit cooperation is the process of negotiati...

The Multi-agent Environment for Constructing Cooperatlve Applications (NECCA) ia based upon a framework unifying the internal behavior of agents and cooperation among agents. This paper presents a formalized view of agent behavior relying on the basic loop of goal activation, plan execution and scheduli~ followed by task execution. This allows for a presentation of the semantics of cooperation ...