Related papers: Comparison between the first Steklov eigenvalue an…
In recent years, discrete spaces such as graphs attract much attention as models for physical spacetime or as models for testing the spirit of non-commutative geometry. In this work, we construct the differential algebras for graphs by…
A natural connection with torsion is defined and it is called the first natural connection on Riemannian $\Pi$-manifold. Relations between the introduced connection and the Levi-Civita connection are obtained, as well as relations between…
We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…
It is proved that the restriction of a $k$ and $(k-1)$-component directed spanning forest of minimal weight to an atom of the subset algebra generated by the sets of vertices of trees of $k$-component minimal spanning forests is a tree. For…
This work investigates upper bounds for the spectrum of the Steklov-type operator on Riemannian manifolds with boundary. We extend the Fraser-Schoen estimate for the first positive Steklov eigenvalue to higher Steklov eigenvalues, in terms…
We consider how the geometry and topology of a compact $n$-dimensional Riemannian orbifold with boundary relates to its Steklov spectrum. In two dimensions, motivated by work of A. Girouard, L. Parnovski, I. Polterovich and D. Sher in the…
We show that, in the graph spectrum of the normalized graph Laplacian on trees, the eigenvalue 1 and eigenvalues near 1 are strongly related to minimum vertex covers. In particular, for the eigenvalue 1, its multiplicity is related to the…
A vertex of degree one is called an end-vertex, and an end-vertex of a tree is called a leaf. A tree with at most $k$ leaves is called a $k$-ended tree. For a positive integer $k$, let $t_k$ be the order of a largest $k$-ended tree. Let…
We present a construction, called the limit of a tree system of spaces (or, less formally, a tree of spaces). The construction is designed to produce compact metric spaces that resemble fractals, out of more regular spaces, such as closed…
Based on solid theoretical foundations, we present strong evidences that a number of real-life networks, taken from different domains like Internet measurements, biological data, web graphs, social and collaboration networks, exhibit…
In this paper, we investigate the monotonicity of the first Steklov--Dirichlet eigenvalue on eccentric annuli with respect to the distance, namely $t$, between the centers of the inner and outer boundaries of an annulus. We first show the…
We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindstr\"om quantifiers. An important instance of our result concerns first-order definable tree languages. Our characterization…
Given a non-oriented edge-weighted graph, we show how to make some estimation of the associated Laplacian eigenvalues through Monte Carlo evaluation of spectral quantities computed along Kirchhoff random rooted spanning forest trajectories.…
In this paper we construct spanning trees in hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has a bounded number of distinct rays to each boundary point. The bound depends only on the…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…
We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…
A graph can be regarded as an electrical network in which each edge is a resistor. This point of view relates combinatorial quantities, such as the number of spanning trees, to electrical ones such as effective resistance. The second and…
Among many topological indices of trees the sum of distances $\sigma(T)$ and the number of subtrees $F(T)$ have been a long standing pair of graph invariants that are well known for their negative correlation. That is, among various given…
In this paper we study a new variant of graph arboricity, which requires all the forests to have the same number of edges (up to a difference of 1). We prove that the new variant, which we call equitable arboricity, is equivalent to…
Hopf algebra structures on rooted trees are by now a well-studied object, especially in the context of combinatorics. In this work we consider a Hopf algebra H by introducing a coproduct on a (commutative) algebra of rooted forests,…