We consider the problem of finding a "fair" or "acceptable" spanning tree in an undirected graph when each member of a group of agents proposes a spanning tree. An "acceptable" spanning tree in that respect is a spanning tree which does not differ in more than a given number of edges from each...

In this paper we take into account three different spanning tree problems with degree-dependent objective functions. The main application of these problems is in the field of optical network design. In particular, we propose the classical Minimum Leaves Spanning Tree problem as a relevant...

Among a variety of subgraphs, spanning trees are one of the most important and fundamental categories. They are relevant to diverse aspects of networks, including reliability, transport, self-organized criticality, loop-erased random walks and so on. In this paper, we introduce a family of...

The dimer problem, Ising spins and bond percolation on the triangular kagomé lattice have been studied extensively by physicists. In this paper, based on the fact the triangular kagomé lattice with toroidal boundary condition can be regarded as the line graph of 3.12.12 lattice with toroidal...

In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological and dynamic properties of the graph, such as its...

We apply the renormalization group approach to the sandpile on the triangular lattice. The only attractive fixed point is found. The obtained fixed point height probabilities are compared with numerical simulations. The value of critical exponent of avalanche size distribution is found to be τ...

In economics, the standard approach to language is that talk is cheap. Here, instead, language is a social convention that affects utility. Unless language is used in its ordinary sense, it cannot help to coordinate actions because there is no way of decoding it. This points to a unique...