English

Asymptotic energy of graphs

Combinatorics 2009-11-13 v2

Abstract

The energy of a simple graph GG arising in chemical physics, denoted by E(G)\mathcal E(G), is defined as the sum of the absolute values of eigenvalues of GG. We consider the asymptotic energy per vertex (say asymptotic energy) for lattice systems. In general for a type of lattice in statistical physics, to compute the asymptotic energy with toroidal, cylindrical, Mobius-band, Klein-bottle, and free boundary conditions are different tasks with different hardness. In this paper, we show that if {Gn}\{G_n\} is a sequence of finite simple graphs with bounded average degree and {Gn}\{G_n'\} a sequence of spanning subgraphs of {Gn}\{G_n\} such that almost all vertices of GnG_n and GnG_n' have the same degrees, then GnG_n and GnG_n' have the same asymptotic energy. Thus, for each type of lattices with toroidal, cylindrical, Mobius-band, Klein-bottle, and free boundary conditions, we have the same asymptotic energy. As applications, we obtain the asymptotic formulae of energies per vertex of the triangular, 33.423^3.4^2, and hexagonal lattices with toroidal, cylindrical, Mobius-band, Klein-bottle, and free boundary conditions simultaneously.

Keywords

Cite

@article{arxiv.0810.0801,
  title  = {Asymptotic energy of graphs},
  author = {Weigen Yan and Zuhe Zhang},
  journal= {arXiv preprint arXiv:0810.0801},
  year   = {2009}
}

Comments

15 pages, 3 figures

R2 v1 2026-06-21T11:27:25.050Z