On the energy of some circulant graphs
By Igor E. Shparlinski. 2006
58 citations recorded by the source corpus.
Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/f1b1df4063740db8e22f6c3b7bd09ec790139de0
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
- Richard A. Brualdi
- Vladimir Nikiforov
- L. Lov'asz
- Peter Rowlinson
- Christian Reiher
- Yongtao Li
- David Conlon
- Joonkyung Lee
In Geometry and Topology
- Richard A. Brualdi
- Vladimir Nikiforov
- Yongtao Li
- L. Lov'asz
- Peter Rowlinson
- Christian Reiher
- Xiaodong Zhang
- Lihua Feng
Citations in the corpus
- Energy of a Graph (2006, methodology): “Using Gaussian sums, Shparlinski [13] gave constructions of circulant graphs with high energy.”
- Minimum energy on trees with k pendent vertices (2006, unknown): “, see, [1,3,5–10,12–23,25–27,29–34]).”
- Graphs and matrices of maximal energy (2006, background): “, [10]) that Gp is a (p− 1) /2-regular graph and σ2 (Gp) = ( p + 1 )”
- The energy of graphs and matrices (2006, unknown): “, [2], [8], [10], [11], [12], [13], and [14]).”
- On the distance spectra of some graphs (2008, unknown): “This definition was motivated by the much older [7] and nowadays extensively studied [8, 9, 10, 13, 14, 15, 16] graph energy, defined in a manner fully analogous to Eq.”