On the connectivity of close to regular multipartite tournaments (Q2492221): Difference between revisions

The global irregularity of a digraph \(D\) is defined by \[ i_g(D)=\max\{d^+(x),d^-(x)\}-\min\{d^+(y), d^-(y)\} \] over all \(x,y\in V(D)\) with \(d^+(x)\) and \(d^-(x)\) the outdegree and the indegree, respectively. The local irregularity of \(D\) is \(i_l(D)= \max|d^+(x)- d^-(x)|\) over all \(x\in V(D)\). If \(i_g(D)= 0\), then \(D\) is regular and if \(i_g(D)\leq 1\), then \(D\) is almost regular. Let \(V_1,\dots, V_c\) be the partite sets of a \(c\)-partite tournament such that \(|V_1|\leq\cdots\leq|V_c|\). \textit{A. Yeo} (PhD Thesis, Odense University, 1998) proved \(K(D)\geq \lceil {1\over 3}(|V(D)|-|V_c|-2i_l(D))\rceil\) for each \(c\)-partite tournament with connectivity \(K(D)\). Here the authors prove that \(K(D)\geq \lceil{1\over 3}(|V(D)|- |V_c|- 2i_l(D)+ 1)\rceil\) in case \(|V_c|\) is odd.