Related papers: Barabasi-Albert trees are hypoenergetic

Recent papers in the graph machine learning literature have introduced a number of approaches for hyperbolic representation learning. The asserted benefits are improved performance on a variety of graph tasks, node classification and link…

We prove that, for any graph $G$, its graph energy is at least twice the Randic index. We show that equality holds if and only if $G$ is the union of complete bipartite graphs.

A graph $H^{\prime}$ is $(H, G)$-saturated if it is $G$-free and the addition of any edge of $H$ not in $H^{\prime}$ creates a copy of $G$. The saturation number $sat(H, G)$ is the minimum number of edges in a $(H, G)$-saturated graph. We…

We prove that a lamplighter graph of a locally finite graph over a finite graph does not admit a non-constant harmonic function of finite Dirichlet energy.

We prove that every graph which admits a tree-decomposition into finite parts has a rooted tree-decomposition into finite parts that is linked, tight and componental. As an application, we obtain that every graph without half-grid minor has…

In this paper, we study energies associated with hypergraphs. More precisely, we obtain results for the incidence and the singless Laplacian energies of uniform hypergraphs. In particular, we obtain bounds for the incidence energy as…

Let $R$ be a Hermitian matrix. The energy of $R$, $\mathcal{E}(R)$, corresponds to the sum of the absolute values of its eigenvalues. In this work it is obtained two lower bounds for $\mathcal{E}(R).$ The first one generalizes a lower bound…

We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.

We show that for every $n$-vertex graph with at least one edge, its treewidth is greater than or equal to $n \lambda_{2} / (\Delta + \lambda_{2}) - 1$, where $\Delta$ and $\lambda_{2}$ are the maximum degree and the second smallest…

The aim of this paper is to further develop the theory of packing trees in a graph. We first prove the classic result of Nash-Williams \cite{NW} and Tutte \cite{Tu} on packing spanning trees by adapting Lov\'asz' proof \cite{Lov} of the…

Surface/edge energy is typically modeled as a continuous function of orientation, $\gamma({\bf n})$. We put forward a simple geometric argument that suggests this picture is inadequate for crystals with a non-Bravais lattice structure. In…

Let V be a simple unitary vertex operator algebra and U be a (polynomially) energy-bounded unitary subalgebra containing the conformal vector of V. We give two sufficient conditions implying that V is energy-bounded. The first condition is…

We show that a group that is hyperbolic relative to strongly shortcut groups is itself strongly shortcut, thus obtaining new examples of strongly shortcut groups. The proof relies on a result of independent interest: we show that every…

We prove that, for an undirected graph with $n$ vertices and $m$ edges, each labeled with a linear function of a parameter $\lambda$, the number of different minimum spanning trees obtained as the parameter varies can be $\Omega(m\log n)$.

Answering a question due to Min, we prove that a finite graph of roses admits a regluing such that the resulting graph of roses has hyperbolic fundamental group.

We prove a generalised super-adiabatic theorem for extended fermionic systems assuming a spectral gap only in the bulk. More precisely, we assume that the infinite system has a unique ground state and that the corresponding GNS-Hamiltonian…

Abstractly, tropical hyperelliptic curves are metric graphs that admit a two-to-one harmonic morphism to a tree. They also appear as embedded tropical curves in the plane arising from triangulations of polygons with all interior lattice…

We study parabolic automorphisms of irreducible holomorphically symplectic manifolds with a lagrangian fibration. Such automorphisms are (possibly up to taking a power) fiberwise translations on smooth fibers, and their orbits in a general…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

For a simple graph $G$, the energy $E(G)$ is defined as the sum of the absolute values of all eigenvalues of its adjacent matrix. For $\Delta\geq 3$ and $t\geq 3$, denote by $T_a(\Delta,t)$ (or simply $T_a$) the tree formed from a path…