<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=23481"><dc:title>Some results on ▫$\sigma_t$▫-irregularity</dc:title><dc:creator>Filipovski,	Slobodan	(Avtor)
	</dc:creator><dc:creator>Dimitrov,	Darko	(Avtor)
	</dc:creator><dc:creator>Knor,	Martin	(Avtor)
	</dc:creator><dc:creator>Škrekovski,	Riste	(Avtor)
	</dc:creator><dc:subject>irregularity</dc:subject><dc:subject>total irregularity</dc:subject><dc:subject>energy of graphs</dc:subject><dc:subject>Laplacian eigenvalues</dc:subject><dc:description>The (\sigma_t)-irregularity (or sigma total index) is a graph invariant defined as [ \sigma_t(G)=\sum_{{u,v}\subseteq V(G)}(d(u)-d(v))^2, ] where (d(z)) denotes the degree of a vertex (z). This irregularity measure was proposed by Réti in 2019 and recently rediscovered by Dimitrov and Stevanović in 2023. In this paper, we remark that (\sigma_t(G)=n^2\operatorname{Var}(G)), where (\operatorname{Var}(G)) is the degree variance of the graph. We show that among all complete bipartite graphs on (n) vertices, one of the corresponding complete bipartite graphs whose part sizes are closest to (n(2-\sqrt{2})/4) and (n(2+\sqrt{2})/4) has the maximum sigma total index. Moreover, various upper and lower bounds for (\sigma_t)-irregularity are provided. In this direction, we establish a relation between the graph energy (\mathcal{E}(G)) and (\sigma_t)-irregularity and derive bounds related to the Laplacian eigenvalues of the graph.</dc:description><dc:date>2026</dc:date><dc:date>2026-08-14 11:04:27</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>23481</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
