关于互补第二萨格勒布指标的一个猜想
On a Conjecture Concerning the Complementary Second Zagreb Index
AI总结:
本文研究互补第二萨格勒布指标最大图的结构,证明其最大度为 n-1、最小度顶点互不相邻,并给出最大度顶点数的上界,为 Furtula 和 Oz 的猜想提供支持。
摘要:
图 $G$ 的互补第二萨格勒布指标定义为 $cM_2(G)=\sum_{uv\in E(G)}|(d_u(G))^2-(d_v(G))^2|$,其中 $d_u(G)$ 表示图 $G$ 中顶点 $u$ 的度数,$E(G)$ 表示 $G$ 的边集。设 $G^*$ 是在所有 $n$ 阶连通图中具有最大 $cM_2$ 值的图。Furtula 和 Oz [MATCH Commun. Math. Comput. Chem. 93 (2025) 247--263] 猜想 $G^*$ 是 $k$ 阶完全图 $K_k$ 与完全图 $K_{n-k}$ 的补图 $\overline{K}_{n-k}$ 的联图 $K_k+\overline{K}_{n-k}$,且满足不等式 $k<\lceil n/2 \rceil$。我们证明了:(i) $G^*$ 的最大度为 $n-1$;(ii) $G^*$ 中任意两个最小度顶点都不相邻;这两个结果都支持上述猜想。我们还证明了 $G^*$ 中最大度顶点的数量(记为 $k$)至多为 $-\frac{2}{3}n+\frac{3}{2}+\frac{1}{6}\sqrt{52n^2-132n+81}$,这意味着 $k<5352n/10000$。此外,我们建立了支持所考虑猜想的结果,适用于某些双度图和极度图。在上述论文中还提到,将 $k$ 确定为 $n$ 的函数远非易事;我们通过使用计算机软件获得了 $5\le n\le 149$ 时某些双度图的 $k$ 值,并发现所得的 $k$ 值序列不存在于“整数序列在线百科全书”(一个整数序列在线数据库)中。
英文摘要:
The complementary second Zagreb index of a graph $G$ is defined as $cM_2(G)=\sum_{uv\in E(G)}|(d_u(G))^2-(d_v(G))^2|$, where $d_u(G)$ denotes the degree of a vertex $u$ in $G$ and $E(G)$ represents the edge set of $G$. Let $G^*$ be a graph having the maximum value of $cM_2$ among all connected graphs of order $n$. Furtula and Oz [MATCH Commun. Math. Comput. Chem. 93 (2025) 247--263] conjectured that $G^*$ is the join $K_k+\overline{K}_{n-k}$ of the complete graph $K_k$ of order $k$ and the complement $\overline{K}_{n-k}$ of the complete graph $K_{n-k}$ such that the inequality $k<\lceil n/2 \rceil$ holds. We prove that (i) the maximum degree of $G^*$ is $n-1$ and (ii) no two vertices of minimum degree in $G^*$ are adjacent; both of these results support the aforementioned conjecture. We also prove that the number of vertices of maximum degree in $G^*$, say $k$, is at most $-\frac{2}{3}n+\frac{3}{2}+\frac{1}{6}\sqrt{52n^2-132n+81}$, which implies that $k<5352n/10000$. Furthermore, we establish results that support the conjecture under consideration for certain bidegreed and tridegreed graphs. In the aforesaid paper, it was also mentioned that determining the $k$ as a function of the $n$ is far from being an easy task; we obtain the values of $k$ for $5\le n\le 149$ in the case of certain bidegreed graphs by using computer software and found that the resulting sequence of the values of $k$ does not exist in "The On-Line Encyclopedia of Integer Sequences" (an online database of integer sequences).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。