<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>A linear lower bound for the square energy of graphs</dc:title><dc:creator>Akbari,	Saieed	(Avtor)
	</dc:creator><dc:creator>Kumar,	Hitesh	(Avtor)
	</dc:creator><dc:creator>Mohar,	Bojan	(Avtor)
	</dc:creator><dc:creator>Pragada,	Shivaramakrishna	(Avtor)
	</dc:creator><dc:subject>graph theory</dc:subject><dc:subject>square energy</dc:subject><dc:description>Let $G$ be a graph of order $n$ with eigenvalues $\lambda_1 \geq \cdots \geq\lambda_n$. Let $s^+(G)=\sum_{\lambda_i&gt;0} \lambda_i^2, s^-(G)=\sum_{\lambda_i&lt;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$.</dc:description><dc:date>2025</dc:date><dc:date>2025-12-02 12:12:27</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>176491</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>ISSN pri članku: 1077-8926</dc:identifier><dc:identifier>DOI: 10.37236/13467</dc:identifier><dc:identifier>COBISS_ID: 253505283</dc:identifier><dc:language>sl</dc:language></metadata>
