The maximal total irregularity of bicyclic graphs (Q2336708)

Summary: In 2012, \textit{H. Abdo} and \textit{D. Dimitrov} [``The total irregularity of a graph'', Preprint, \url{arXiv:1207.5267}] defined the total irregularity of a graph \(G = (V, E)\) as \(\mathrm{irr}_t (G) = (1/2) \sum_{u,v\in V} \left| d_G (u) - d_G(v)\right|\), where \(d_G(u)\) denotes the vertex degree of a vertex \(u \in V\). In this paper, we investigate the total irregularity of bicyclic graphs and characterize the graph with the maximal total irregularity among all bicyclic graphs on \(n\) vertices.