Note on non-regular graphs with minimal total irregularity

Ali Reza Ashrafi and Ali Ghalavand

Applied Mathematics and Computation, 2020, vol. 369, issue C

Abstract: Let G be a graph with vertex set V(G). The total irregularity of G is defined as irrt(G)=∑{u,v}⊆V(G)|degG(u)−degG(v)|, where degG(v) is the degree of the vertex v of G. The aim of this paper is to present some bounds for this graph invariant. A new simple proof for a recently proposed conjecture on total irregularity of graphs is also presented.

Keywords: Irregularity; Total irregularity; Degree sequence (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319308835
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:369:y:2020:i:c:s0096300319308835

DOI: 10.1016/j.amc.2019.124891

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().