Two irregularity measures possessing high discriminatory ability
From MaRDI portal
Publication:6090922
Abstract: An -vertex graph whose degree set consists of exactly elements is called antiregular graph. Such type of graphs are usually considered opposite to the regular graphs. An irregularity measure () of a connected graph is a non-negative graph invariant satisfying the property: if and only if is regular. The total irregularity of a graph , denoted by , is defined as where is the vertex set of and , denote the degrees of the vertices , , respectively. Antiregular graphs are the most nonregular graphs according to the irregularity measure ; however, various non-antiregular graphs are also the most nonregular graphs with respect to this irregularity measure. In this note, two new irregularity measures having high discriminatory ability are devised. Only antiregular graphs are the most nonregular graphs according to the proposed measures.
Recommendations
Cited In (4)
This page was built for publication: Two irregularity measures possessing high discriminatory ability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090922)