Some results on σ_t-irregularity

The σt-irregularity (or sigma total index) is a graph invariant which is defined as σt(G)= ∑{u, v} ⊆ V(G)(d(u) − d(v))², where d(z) denotes the degree of 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 σt(G)=n2Var(G), where Var(G) is the degree variance of the graph. We show that among all complete bipartite graphs on n vertices, either the complete bipartite graph K⌊n/4(2-\sqrt{2})⌋, ⌈n/4(2+\sqrt{2}⌉ or K⌈n/4(2-\sqrt{2}⌉ , ⌊n/4(2+\sqrt{2})⌋ has the maximum sigma total index. Moreover, various upper and lower bounds for σt-irregularity are provided; in this direction we give a relation between the graph energy ℰ(G) and sigma total index σt(G) and give new proofs of two results by Dimitrov and Stevanović.Applying Fiedler's characterization of the largest and the second smallest Laplacian eigenvalue of the graph, we also establish new relationships between σt and σ. We conclude the paper with two conjectures.

Authors

Institutions

Publication Details

Journal
Ars Mathematica Contemporanea
Published
2025-10-13
DOI
https://doi.org/10.26493/1855-3974.3268.60f
Primary Topic
Approximation Theory and Sequence Spaces
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Some results on σ_t-irregularity

Darko Dimitrov, Slobodan Filipovski, Martin Knor, Riste Škrekovski
Ars Mathematica Contemporanea
Approximation Theory and Sequence Spaces
article

Some results on σ_t-irregularity

Darko Dimitrov, Slobodan Filipovski, Martin Knor, Riste Škrekovski
article en

Abstract

The σt-irregularity (or sigma total index) is a graph invariant which is defined as σt(G)= ∑{u, v} ⊆ V(G)(d(u) − d(v))², where d(z) denotes the degree of 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 σt(G)=n2Var(G), where Var(G) is the degree variance of the graph. We show that among all complete bipartite graphs on n vertices, either the complete bipartite graph K⌊n/4(2-\sqrt{2})⌋, ⌈n/4(2+\sqrt{2}⌉ or K⌈n/4(2-\sqrt{2}⌉ , ⌊n/4(2+\sqrt{2})⌋ has the maximum sigma total index. Moreover, various upper and lower bounds for σt-irregularity are provided; in this direction we give a relation between the graph energy ℰ(G) and sigma total index σt(G) and give new proofs of two results by Dimitrov and Stevanović.Applying Fiedler's characterization of the largest and the second smallest Laplacian eigenvalue of the graph, we also establish new relationships between σt and σ. We conclude the paper with two conjectures.

Ars Mathematica Contemporanea
Slovak University of Technology in Bratislava (SK), University of Primorska (SI), Higher Education Centre Novo Mesto (SI)
Javna Agencija za Raziskovalno Dejavnost RS, Agentúra na Podporu Výskumu a Vývoja, Vedecká Grantová Agentúra MŠVVaŠ SR a SAV
Openalex Percentile: Top 73%
Approximation Theory and Sequence Spaces
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.