The total irregularity of a graph

Hosam Abdo, Stephan Brandt, Darko Dimitrov

Discrete Mathematics & Theoretical Computer Science · 2014 · 105 citations · 15 references

DOIFull text

Open access

Concepts

Abstract

Graph Theory In this note a new measure of irregularity of a graph G is introduced. It is named the total irregularity of a graph and is defined as irr(t)(G) - 1/2 Sigma(u, v is an element of V(G)) vertical bar d(G)(u) - d(G)(v)vertical bar, where d(G)(u) denotes the degree of a vertex u is an element of V(G). All graphs with maximal total irregularity are determined. It is also shown that among all trees of the same order the star has the maximal total irregularity.

References

15