图的不规则性的界与计算
Bounds and Computation of Irregularity of a Graph
摘要:
Albertson将简单无向图$G=(V,E)$的不规则性定义为$ \irr(G) = \sum_{uv\in E}|d_G(u)-d_G(v)|,$,其中$d_G(u)$表示顶点$u \in V$的度。最近,这个图不变量在化学图论中引起了人们的兴趣,它出现在第一和第二Zagreb指标的某些界限中,并被命名为第三Zagreb指标Fath-Tabar。对于一般图的$n$顶点,艾伯森已经得到了一个渐近紧的上界的不规则性$4 n^3 /27.$在这里,通过利用不同的方法比艾伯森,我们表明,一般图的$n$顶点的上界$\lfloor \frac{n}{3} \rfloor \lceil \frac{2 n}{3} \rceil (\lceil \frac{2 n}{3} \rceil -1)$是尖锐的。其次,我们确定了具有最大不规则性的$k$ -循环图。我们还提出了一些界限上的最大/最小不规则的固定的最小和/或最大顶点度的图,并考虑一个近似计算的不规则的图。
英文摘要:
Albertson has defined the irregularity of a simple undirected graph $G=(V,E)$ as $ \irr(G) = \sum_{uv\in E}|d_G(u)-d_G(v)|,$ where $d_G(u)$ denotes the degree of a vertex $u \in V$. Recently, this graph invariant gained interest in the chemical graph theory, where it occured in some bounds on the first and the second Zagreb index, and was named the third Zagreb index Fath-Tabar. For general graphs with $n$ vertices, Albertson has obtained an asymptotically tight upper bound on the irregularity of $4 n^3 /27.$ Here, by exploiting a different approach than in Albertson, we show that for general graphs with $n$ vertices the upper bound $\lfloor \frac{n}{3} \rfloor \lceil \frac{2 n}{3} \rceil (\lceil \frac{2 n}{3} \rceil -1)$ is sharp. Next, we determine $k$-cyclic graphs with maximal irregularity. We also present some bounds on the maximal/minimal irregularity of graphs with fixed minimal and/or maximal vertex degrees, and consider an approximate computation of the irregularity of a graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。