Related papers: Asymptotic energy of graphs
Answering some questions of Gutman, we show that, except for four specific trees, every connected graph G of order n, with no cycle of order 4 and with maximum degree at most 3, has energy greater that its order. Here, the energy of a graph…
In this paper we argue that classical, asymptotically AdS spacetimes that arise as states in consistent ultraviolet completions of Einstein gravity coupled to matter must satisfy an infinite family of positive energy conditions. To each…
In this work, we define the Laplacian and Normalized Laplacian energies of vertices in a graph, we derive some of its properties and relate them to combinatorial, spectral and geometric quantities of the graph.
In this article we examine the adjacency and Laplacian matrices and their eigenvalues and energies of the general product (non-complete extended $p$-sum, or NEPS) of signed graphs. We express the adjacency matrix of the product in terms of…
We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…
A family of spin-lattice models are derived as convergent finite dimensional approximations to the rest frame kinetic energy of a barotropic fluid coupled to a massive rotating sphere. In not fixing the angular momentum of the fluid…
The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…
In this paper, we study a one-dimensional tight-binding model with tunable incommensurate potentials. Through the analysis of the inverse participation rate, we uncover that the wave functions corresponding to the energies of the system…
This paper is concerned with the asymptotic behavior of the free energy for a class of Hermitean random matrix models, with odd degree polynomial potential, in the large N limit. It continues an investigation initiated and developed in a…
Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…
The geometric properties of a lattice can have profound consequences on its band spectrum. For example, symmetry constraints and geometric frustration can give rise to topologicially nontrivial and dispersionless bands, respectively.…
We applied tensor network contraction algorithms to compute the hard-core lattice gas model, i.e., the enumeration of independent sets on grid graphs. We observed the influence of surface effect and parity effect on the enumeration (and…
The eccentricity matrix of a connected graph $G$, denoted by $\mathcal{E}(G)$, is obtained from the distance matrix of $G$ by keeping the largest nonzero entries in each row and each column and leaving zeros in the remaining ones. The…
For a simple graph $G$ and a real number $\alpha $ $\left(\alpha \neq 0,1\right) $ the graph invariant $s_{\alpha}\left(G\right) $ is equal to the sum of powers of signless Laplacian eigenvalues of $G$. In this note, we present some new…
We derive the complete asymptotic expansion in terms of powers of $N$ for the geodesic $f$-energy of $N$ equally spaced points on a rectifiable simple closed curve $\Gamma$ in ${\mathbb R}^p$, $p\geq2$, as $N \to \infty$. For $f$ decreasing…
We have studied thermodynamic properties of noninteracting gases in periodic lattice potential at arbitrary integer fillings and compared them with that of ideal homogeneous gases. Deriving explicit expressions for thermodynamic quantities…
The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count n and a set D of divisors…
We consider the spherical limit of multi-matrix models on regular target graphs, for instance single or multiple Potts models, or lattices of arbitrary dimension. We show, to all orders in the low temperature expansion, that when the degree…
The commuting conjugacy class graph of a non-abelian group $G$, denoted by $\mathcal{CCC}(G)$, is a simple undirected graph whose vertex set is the set of conjugacy classes of the non-central elements of $G$ and two distinct vertices $x^G$…
The matching energy of a graph was introduced by Gutman and Wagner, which is defined as the sum of the absolute values of the roots of the matching polynomial of the graph. For the random graph $G_{n,p}$ of order $n$ with fixed probability…