Two irregularity measures possessing high discriminatory ability

DOI10.47443/CM.2020.0003arXiv1904.05053OpenAlexW2938651730MaRDI QIDQ6090922FDOQ6090922

Authors: Akbar Ali, Tamás Réti 

Publication date: 20 November 2023

Published in: Contributions to Mathematics (Search for Journal in Brave)

Abstract: An $n$-vertex graph whose degree set consists of exactly $n-1$ elements is called antiregular graph. Such type of graphs are usually considered opposite to the regular graphs. An irregularity measure ($IM$) of a connected graph $G$ is a non-negative graph invariant satisfying the property: $IM(G)=0$ if and only if $G$ is regular. The total irregularity of a graph $G$, denoted by $ir{r}_t(G)$, is defined as $ir{r}_t(G)=su{m}_{u,vsubseteqV(G)}|d_u-d_v|$ where $V(G)$ is the vertex set of $G$ and $d_u$, $d_v$ denote the degrees of the vertices $u$, $v$, respectively. Antiregular graphs are the most nonregular graphs according to the irregularity measure $ir{r}_t$; 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.

Full work available at URL: https://arxiv.org/abs/1904.05053

Recommendations

• Irregularidad de grafos: Discusión, extensiones de grafos y nuevas propuestas
• The total irregularity of a graph
• A note on the irregularity of graphs
• Extremely irregular graphs

zbMATH Keywords

irregularityirregularity measurenonregular graphantiregular graphtotal irregularity

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Vertex degrees (05C07)

Cited In (4)

• Mostar index: results and perspectives
• Complementary topological indices
• On total irregularity index of trees with given number of segments or branching vertices
• Maximum total irregularity index of some families of graph with maximum degree \(n-1\)

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)