Related papers: Change Intolerance in Spanning Forests
The problem of finding a spanning forest of a graph in a distributed-processing environment is studied. If an input graph is weighted, then the goal is to find a minimum-weight spanning forest. The processors communicate by broadcasting.…
If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…
The margins within the geographic range of species are often specific in terms of ecological and evolutionary processes, and can strongly influence the species' reaction to climate change. One of the frequently observed features at range…
We prove that every connected graph with $s$ vertices of degree~1 and 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${1\over 3}t +{1\over 4}s+{3\over 2}$ leaves. We present infinite series of graphs showing that…
We prove, that every connected graph with $s$ vertices of degree 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${2\over 5}t +{1\over 5}s+\alpha$ leaves, where $\alpha \ge {8\over 5}$. Moreover, $\alpha \ge 2$ for…
Can one hear the 'sound' of a growing network? We address the problem of recognizing the topology of evolving biological or social networks. Starting from percolation theory, we analytically prove a linear inverse relationship between two…
Bootstrap percolation is a type of cellular automaton which has been used to model various physical phenomena, such as ferromagnetism. For each natural number $r$, the $r$-neighbour bootstrap process is an update rule for vertices of a…
Multilayer networked systems are ubiquitous in nature and engineering, and the robustness of these systems against failures is of great interest. A main line of theoretical pursuit has been percolation induced cascading failures, where…
We investigate by exact optimization the geometrical properties of three-dimensional elastic line systems with point disorder and hard-core repulsion. The line 'forests' become entangled due to increasing line wandering as the system height…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
Let $T$ be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of $T$ is denoted by $Leaf(T)$. The subtree $T-Leaf(T)$ of $T$ is called the stem of $T$…
We prove that every connected graph with $s$ vertices of degree not 2 has a spanning tree with at least ${1\over 4}(s-2)+2$ leaves. Let $G$ be a be a connected graph of girth $g$ with $v>1$ vertices. Let maximal chain of successively…
For horocyclic products of percolation subtrees of regular trees, we show almost sure amenability. Under a symmetry condition concerning the growth of the two percolation trees, we show the existence of an increasing Foelner sequence (which…
Suspensions of hard core spherical particles of diameter $D$ with inter-core connectivity range $\delta$ can be described in terms of random geometric graphs, where nodes represent the sphere centers and edges are assigned to any two…
A graph $G$ is asymmetrizable if it has a set of vertices whose setwise stablizer only consists of the identity automorphism. The motion $m$ of a graph is the minimum number of vertices moved by any non-identity automorphism. It is known…
Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of…
Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…
Phylogenetic invariants are not the only constraints on site-pattern frequency vectors for phylogenetic trees. A mutation matrix, by its definition, is the exponential of a matrix with non-negative off-diagonal entries; this positivity…
The number of spanning trees in a class of directed circulant graphs with generators depending linearly on the number of vertices $\beta n$, and in the $n$-th and $(n-1)$-th power graphs of the $\beta n$-cycle are evaluated as a product of…
We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…