Skip to main navigation Skip to search Skip to main content

Classification of borderenergetic chemical graphs and borderenergetic graphs of order 12

  • Péter Csikvári
  • , Ivan Damnjanović*
  • , Marko Milošević
  • , Ivan Stanković
  • , Dragan Stevanović
  • *Corresponding author for this work
  • Alfréd Rényi Institute of Mathematics
  • Eötvös Loránd University
  • University of Primorska
  • University of Nis
  • Diffine LLC
  • Abdullah Al Salem University

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

The energy E(G) of a simple graph G is the sum of absolute values of the eigenvalues of its adjacency matrix. A borderenergetic graph of order n∈N is any noncomplete graph G such that E(G)=E(Kn)=2n−2. Here we combine two-phase computer-assisted search with theoretical arguments to show that there are only three borderenergetic chemical graphs, thus completing the earlier findings of Li et al. (2017). We perform two-phase computer-assisted search to also find all 566 borderenergetic graphs of order 12, thereby correcting and extending the results from a previous search performed by Furtula and Gutman (2017).

Original languageEnglish
Pages (from-to)394-403
Number of pages10
JournalDiscrete Applied Mathematics
Volume376
DOIs
StatePublished - 15 Dec 2025
Externally publishedYes

Keywords

  • Borderenergetic graphs
  • Chemical graphs
  • Graph energy

Fingerprint

Dive into the research topics of 'Classification of borderenergetic chemical graphs and borderenergetic graphs of order 12'. Together they form a unique fingerprint.

Cite this