Nonregular graphs with minimal total irregularity
From MaRDI portal
Abstract: The {it total irregularity} of a simple undirected graph is defined as , where denotes the degree of a vertex . Obviously, if and only if is regular. Here, we characterize the non-regular graphs with minimal total irregularity and thereby resolve the recent conjecture by Zhu, You and Yang~cite{zyy-mtig-2014} about the lower bound on the minimal total irregularity of non-regular connected graphs. We show that the conjectured lower bound of is attained only if non-regular connected graphs of even order are considered, while the sharp lower bound of is attained by graphs of odd order. We also characterize the non-regular graphs with the second and the third smallest total irregularity.
Recommendations
Cites work
Cited in
(14)- On the \(\sigma_t\)-irregularity and the inverse irregularity problem
- scientific article; zbMATH DE number 7020668 (Why is no real title available?)
- Bounds and optimal results for the total irregularity measure
- Minimum Total Irregularity Index Of The Tricyclic Graphs
- Relations between total irregularity and non-self-centrality of graphs
- Maximum non-self-centrality number of trees with a fixed number of pendant vertices
- Ordering of \(c\)-cyclic graphs with respect to total irregularity
- Note on irregular graphs
- Graphs with maximal \(\sigma\) irregularity
- Note on non-regular graphs with minimal total irregularity
- Graph irregularity and its measures
- The minimal total irregularity of some classes of graphs
- A smallest irregular oriented graph containing a given diregular one
- Comparison between the non-self-centrality number and the total irregularity of graphs
This page was built for publication: Nonregular graphs with minimal total irregularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501742)