Details

A linear lower bound for the square energy of graphs
ID Akbari, Saieed (Author), ID Kumar, Hitesh (Author), ID Mohar, Bojan (Author), ID Pragada, Shivaramakrishna (Author)

.pdfPDF - Presentation file, Download (244,05 KB)
MD5: 8597E9DEA69AE484BCE66CE665DB0C4E
URLURL - Source URL, Visit https://www.combinatorics.org/ojs/index.php/eljc/article/view/v32i3p53 This link opens in a new window

Abstract
Let $G$ be a graph of order $n$ with eigenvalues $\lambda_1 \geq \cdots \geq\lambda_n$. Let $s^+(G)=\sum_{\lambda_i>0} \lambda_i^2, s^-(G)=\sum_{\lambda_i<0} \lambda_i^2$. The smaller value, $s(G)=\min\{s^+(G), s^-(G)\}$ is called the square energy of $G$. In 2016, Elphick, Farber, Goldberg and Wocjan conjectured that for every connected graph $G$ of order $n$, $s(G)\geq n-1$. No linear bound for $s(G)$ in terms of $n$ is known. Let $H_1, \ldots, H_k$ be disjoint vertex-induced subgraphs of $G$. In this note, we prove that $s^+(G)\geq\sum_{i=1}^{k} s^+(H_i)$ and $s^-(G)\geq\sum_{i=1}^{k} s^-(H_i)$, which implies that $s(G)\geq \frac{3n}{4}$ for every connected graph $G$ of order $n\ge 4$.

Language:English
Keywords:graph theory, square energy
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FMF - Faculty of Mathematics and Physics
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2025
Year:2025
Number of pages:6 str.
Numbering:Vol. 32, iss. 3, art. no. P3.53
PID:20.500.12556/RUL-176491 This link opens in a new window
UDC:519.17
ISSN on article:1077-8926
DOI:10.37236/13467 This link opens in a new window
COBISS.SI-ID:253505283 This link opens in a new window
Publication date in RUL:02.12.2025
Views:741
Downloads:151
Metadata:XML DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Record is a part of a journal

Title:The Electronic journal of combinatorics
Shortened title:Electron. j. comb.
Publisher:N.J. Calkin and H.S. Wilf
ISSN:1077-8926
COBISS.SI-ID:6973785 This link opens in a new window

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Projects

Funder:EC - European Commission
Project number:101071836
Name:KARST: Predicting flow and transport in complex Karst systems
Acronym:KARST

Funder:NSERC - Natural Sciences and Engineering Research Council of Canada
Funding programme:Discovery Grant
Project number:R832714

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back