Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2501.01538

Bounds and Optimal Results for the Total Irregularity Measure

Akbar Ali·Darko Dimitrov·Tamás Réti·Abeer M. Albalahi·Amjad E. Hamza
View original source ↗Read source document ↗Export metadata ↓

Abstract

A (molecular) graph in which all vertices have the same degree is known as a regular graph. According to Gutman, Hansen, and Mélot [J. Chem. Inf. Model. 45 (2005) 222-230], it is of interest to measure the irregularity of nonregular molecular graphs both for descriptive purposes and for QSAR/QSPR studies. The graph invariants that can be used to measure the irregularity of graphs are referred to as irregularity measures. One of the well-studied irregularity measures is the ``total irregularity'' measure, which was introduced about a decade ago. Bounds and optimization problems for this measure have already been extensively studied. A considerable number of existing results (concerning this measure) also hold for molecular graphs; particularly, the ones regarding lower bounds and minimum values of the mentioned measure. The primary objective of the present review article is to collect the existing bounds and optimal results concerning the total irregularity measure. Several open problems related to the existing results on the total irregularity measure are also given.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Akbar Ali, Darko Dimitrov, Tamás Réti, Abeer M. Albalahi, Amjad E. Hamza. 2025-01-02. Bounds and Optimal Results for the Total Irregularity Measure. https://arxiv.org/abs/2501.01538

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗