Integral circulant graphs of prime power order with maximal energy

DOI10.1016/J.LAA.2011.05.039zbMATH Open1226.05164arXiv1112.3205OpenAlexW2009876987MaRDI QIDQ716435FDOQ716435

Authors: J. W. Sander, T. Sander 

Publication date: 22 September 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: 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 of n in such a way that they have vertex set Zn and edge set {{a, b} : a, b in Zn; gcd(a - b, n) in D}. Using tools from convex optimization, we study the maximal energy among all integral circulant graphs of prime power order ps and varying divisor sets D. Our main result states that this maximal energy approximately lies between s(p - 1)p^(s-1) and twice this value. We construct suitable divisor sets for which the energy lies in this interval. We also characterize hyperenergetic integral circulant graphs of prime power order and exhibit an interesting topological property of their divisor sets.

Full work available at URL: https://arxiv.org/abs/1112.3205

Recommendations

• The energy of integral circulant graphs with prime power order
• The maximal energy of classes of integral circulant graphs
• The exact maximal energy of integral circulant graphs with prime power order
• Extremal energies of integral circulant graphs via multiplicativity
• The eigenvalues and energy of integral circulant graphs

zbMATH Keywords

convex optimizationCayley graphsintegral graphscirculant graphsgraph energygcd graphs

Mathematics Subject Classification ID

Convex programming (90C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Convexity of real functions of several variables, generalizations (26B25) Optimality conditions for minimax problems (49K35)

Cites Work

• Variational Analysis
• Maximal energy graphs
• The energy of graphs and matrices
• On the energy of \((0, 1)\)-matrices
• Remarks on hyperenergetic circulant graphs
• Title not available (Why is that?)
• Graphs with integral spectrum
• Another Proof that Convex Functions are Locally Lipschitz
• Integral circulant graphs
• The energy of a graph
• Note on the energy of regular graphs
• Some properties of unitary Cayley graphs
• On the energy of unitary Cayley graphs
• Title not available (Why is that?)
• The energy of integral circulant graphs with prime power order
• On the energy of some circulant graphs
• On the clique number of integral circulant graphs
• The energy of unitary Cayley graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• Integral circulant Ramanujan graphs of prime power order
• The energy of integral circulant graphs with prime power order
• Extremal energies of integral circulant graphs via multiplicativity
• The exact maximal energy of integral circulant graphs with prime power order
• The eigenvalues and energy of integral circulant graphs
• A sharp upper bound on the incidence energy of graphs in terms of connectivity
• Eigenvalues of Cayley graphs
• Quadratic unitary Cayley graphs of finite commutative rings
• The maximal energy of classes of integral circulant graphs
• Integral circulant graphs with four distinct eigenvalues
• On incidence energy of graphs

This page was built for publication: Integral circulant graphs of prime power order with maximal energy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716435)