New measures of graph irregularity
Combinatorics
2014-11-05 v7 Discrete Mathematics
Abstract
In this paper, we define and compare four new measures of graph irregularity. We use these measures to prove upper bounds for the chromatic number and the Colin de Verdiere parameter. We also strengthen the concise Turan theorem for irregular graphs and investigate to what extent Turan's theorem can be similarly strengthened for generalized r-partite graphs. We conclude by relating these new measures to the Randic index and using the measures to devise new normalised indices of network heterogeneity.
Keywords
Cite
@article{arxiv.1305.3570,
title = {New measures of graph irregularity},
author = {Clive Elphick and Pawel Wocjan},
journal= {arXiv preprint arXiv:1305.3570},
year = {2014}
}