Closed and asymptotic formulas for energy of some circulant graphs
From MaRDI portal
Publication:2979487
Abstract: We consider circulant graphs G(r,N) where the vertices are the integers modulo N and the neighbours of 0 are {-r,...,-1,1,...,r}. The energy of G(r,N) is a trigonometric sum of N*r terms. For low values of r we compute this sum explicitly. We also study the asymptotics of the energy of G(r,N) for big N. There is a known integral formula for the linear growth coefficient, we find a new expression of the form of a finite trigonometric sum with r terms. As an application we show that in the family G(r,N) for r less or equal than 4 there is a finite number of hyperenergetic graphs. On the other hand, for each r>4 there is at most a finite number of non-hyperenergetic graphs of the form G(r,N). Finally we show that the graph G(r,2r+1) minimizes the energy among all the regular graphs of degree 2r.
Recommendations
Cites work
Cited in
(8)- An upper bound of the energy of circulant graphs
- On the energy of 3-circulant graphs
- On the energy of some circulant graphs
- Asymptotic energy of connected cubic circulant graphs
- A formula for the energy of circulant graphs with two generators
- scientific article; zbMATH DE number 7380521 (Why is no real title available?)
- Remarks on hyperenergetic circulant graphs
- On the average energy of circulant graphs
This page was built for publication: Closed and asymptotic formulas for energy of some circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979487)