English
Related papers

Related papers: Asymptotic energy of graphs

200 papers

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.

Combinatorics · Mathematics 2020-09-18 Gerardo Arizmendi , Octavio Arizmendi

A finite action principle for Einstein-Gauss-Bonnet AdS gravity is presented. The boundary term, which is different for even and odd dimensions, is a functional of the boundary metric, intrinsic curvature and extrinsic curvature. For even…

High Energy Physics - Theory · Physics 2009-11-11 Georgios Kofinas , Rodrigo Olea

Let $G$ be a simple undirected graph with vertex set $V(G)=\{v_1, v_2, \ldots, v_n\}$ and edge set $E(G)$. The Sombor matrix $\mathcal{S}(G)$ of a graph $G$ is defined so that its $(i,j)$-entry is equal to $\sqrt{d_i^2+d_j^2}$ if the…

Combinatorics · Mathematics 2021-03-02 Zhen Lin

We present exact calculations of the Potts model partition function $Z(G,q,v)$ for arbitrary $q$ and temperature-like variable $v$ on self-dual strip graphs $G$ of the square lattice with fixed width $L_y$ and arbitrarily great length $L_x$…

Statistical Mechanics · Physics 2009-11-07 Shu-Chiuan Chang , Robert Shrock

We study the dependence of entropy [per lattice site] of six-vertex model on boundary conditions. We start with lattices of finite size and then proceed to thermodynamic limit. We argue that the six-vertex model with periodic, anti-periodic…

Statistical Mechanics · Physics 2015-06-15 T. S. Tavares , G. A. P. Ribeiro , V. E. Korepin

Let $G$ be a simple graph with order $n$ and size $m$. The quantity $M_1(G)=\displaystyle\sum_{i=1}^{n}d^2_{v_i}$ is called the first Zagreb index of $G$, where $d_{v_i}$ is the degree of vertex $v_i$, for all $i=1,2,\dots,n$. The signless…

Combinatorics · Mathematics 2022-05-10 S. Pirzada , Saleem Khan

We define the following parameter of connected graphs. For a given graph $G$ we place one agent in each vertex of $G$. Every pair of agents sharing a common edge is declared to be acquainted. In each round we choose some matching of $G$…

Computational Complexity · Computer Science 2014-03-14 Itai Benjamini , Igor Shinkar , Gilad Tsur

The enhanced power graph $\mathcal{P}_E(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this article, we…

Group Theory · Mathematics 2022-07-12 Parveen , Jitender Kumar

The energy $E(G)$ of a graph $G$ is defined as the sum of the absolute values of the eigenvalues of $G$. An $n$-vertex graph is said to be hypoenergetic if $E(G)<n$ and strongly hypoenergetic if $E(G)<n-1$. In this paper, we consider…

Combinatorics · Mathematics 2009-05-26 Xueliang Li , Hongping Ma

Let $G=(V,E)$ be a simple connected graph. A matching of $G$ is a set of disjoint edges of $G$. For every $n, m\in\mathbb{N}$, the $n$-subdivision of $G$ is a simple graph $G^{\frac{1}{n}}$ which is constructed by replacing each edge of $G$…

Combinatorics · Mathematics 2018-06-04 Saeid Alikhani , Neda Soltani

In the present communication we consider the one-dimensional (1D) isotopically disordered lattice with the harmonic potential. Our analytical method is adequate for any 1D lattice where potential energy can be presented as the quadratic…

Disordered Systems and Neural Networks · Physics 2007-05-23 Vladimir N. Likhachev , Juraj Szavits-Nossan , George A. Vinogradov

The free energy of the finite and non-isotropic Ising lattice with Brascamp-Kunz boundary conditions is calculated exactly as a series in the absence of an external magnetic field.

Statistical Mechanics · Physics 2008-10-27 I. Lyberg

We define renormalised energies for maps that describe the first-order asymptotics of harmonic maps outside of singularities arising due to obstructions generated by the boundary data and the mutliple connectedness of the target manifold.…

Analysis of PDEs · Mathematics 2022-08-09 Antonin Monteil , Rémy Rodiac , Jean Van Schaftingen

Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…

Combinatorics · Mathematics 2015-07-22 Élie de Panafieu , Lander Ramos

On finite metric graphs the set of all realizations of the Laplace operator in the edgewise defined $L^2$-spaces are studied. These are defined by coupling boundary conditions at the vertices most of which define non-self-adjoint operators.…

Spectral Theory · Mathematics 2021-04-02 Amru Hussein

Let $G$ be a simple connected graph on $n$ vertices, and let $\lambda_1(G),\lambda_2(G),\ldots,\lambda_n(G)$ be the eigenvalues of its adjacency matrix $A(G)$. For $p>0$, define the $p$-energy of $G$ by $\mathcal E_p(G)=\sum_{i=1}^n…

Combinatorics · Mathematics 2026-05-22 Yinchen Liu , Quanyu Tang

For a given simple graph $G$, the energy of $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let $P_n^{\ell}$ be the unicyclic graph obtained by connecting a vertex of $C_\ell$…

Combinatorics · Mathematics 2011-02-18 Bofeng Huo , Xueliang Li , Yongtang Shi

Adsorbed gases within, or outside of, carbon nanotubes may be analyzed with an approximate model of adsorption on lattice sites situated on a cylindrical surface. Using this model, the ground state energies of alternative lattice structures…

Soft Condensed Matter · Physics 2016-08-31 M. Mercedes Calbi , Silvina M. Gatica , Mary J. Bojan , Milton W. Cole

We determine numerically the single-particle and the two-particle spectrum of the three-state quantum Potts model on a lattice by using the density matrix renormalization group method, and extract information on the asymptotic (small…

Statistical Mechanics · Physics 2013-01-30 Akos Rapp , Peter Schmitteckert , Gabor Takacs , Gergely Zarand

We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers $V_{\lambda}^{\otimes N}$ of an irreducible representation $V_{\lambda}$ of a compact connected Lie group $G$. The weights are…

Representation Theory · Mathematics 2011-11-10 Tatsuya Tate , Steve Zelditch