Some new results on total irregularity of graphs
Journal of Information & Optimization Sciences · 2026 · 47 (3) · 1051-1062
DOI: 10.47974/jios-1845 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Information & Optimization Sciences, 2026. Verfasst von Nima Ghanbari und 2 weiteren Autor:innen.
Abstract (Originalsprache)
The overall variation in vertex connections within a graph, known as the total irregularity, is quantified by summing half the absolute differences between the degrees of every vertex pair. This study investigates how this measure of irregularity behaves when a graph undergoes two specific transformations: the creation of a k-subdivision and the Kr- gluing of two graphs.
Zitieren
APA
Ghanbari, N., Dehghanizadeh, M. A., & Alikhani, S. (2026). Some new results on total irregularity of graphs. Journal of Information & Optimization Sciences, 47(3), 1051-1062. https://doi.org/10.47974/jios-1845
Vancouver
Ghanbari N, Dehghanizadeh MA, Alikhani S. Some new results on total irregularity of graphs. Journal of Information & Optimization Sciences. 2026;47(3):1051-1062. doi:10.47974/jios-1845
BibTeX
@article{Ghanbari2026,
author = {Ghanbari, Nima and Dehghanizadeh, Mohammad Ali and Alikhani, Saeid},
title = {Some new results on total irregularity of graphs},
journal = {Journal of Information & Optimization Sciences},
year = {2026},
volume = {47},
number = {3},
pages = {1051--1062},
doi = {10.47974/jios-1845}
}
EUVIMED