The Minimal Total Irregularity of Graphs

Authors Yingxue Zhu, Lihua You, Jieshan Yang

Publication date 3 April 2014

Abstract: In cite{2012a}, Abdo and Dimitov defined the total irregularity of a graph

G = (V, E)

as hskip3.3cm

m i r r_{t}

(G) = f r a c 12 s u m_{u, v i n V} | d_{G} (u) - d_{G} (v) |,

oindent where

d_{G} (u)

denotes the vertex degree of a vertex

u i n V

. In this paper, we investigate the minimal total irregularity of the connected graphs, determine the minimal, the second minimal, the third minimal total irregularity of trees, unicyclic graphs, bicyclic graphs on

n

vertices, and propose an open problem for further research.

This page was built for publication: The Minimal Total Irregularity of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6250424)