arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2507.02015math.CO
收藏

图的 Marcello 补全

Marcello's completion of graphs

Johan Kok

AI总结:

本文提出图的 Marcello 补全新优化问题,定义 Marcello 数 ϖ(G) 为按 Marcello 规则迭代加边至完全图 Kn 所需的最小步数,并给出若干初步结果。

摘要:

本文开启了对图补全相关的一个新优化问题的研究。所定义的步骤称为图的 Marcello 补全。对于 n 阶图 G,Marcello 数是通过迭代构造图 G1,G2,…,Gk 得到的,其中每一步按照 Marcello 规则在不同且不相邻的顶点对之间添加最大数量的边。如果对于最小的 k,所得图 Gk 同构于 Kn,那么图 G 的 Marcello 数记为 ϖ(G),且等于 ϖ(G)=k。按约定 ϖ(Kn)=0,n≥1。文中给出了若干入门性结果。

英文摘要:

This paper initiates a study on a new optimization problem with regards to graph completion. The defined procedure is called, \emph{Marcello's completion} of a graph. For graph $G$ of order $n$ the \emph{Marcello number} is obtained by iteratively constructing graphs, $G_1,G_2,\dots,G_k$ by adding a maximal number of edges between pairs of distinct, non-adjacent vertices in accordance with the \emph{Marcello rule}. If for smallest $k$ the resultant graph $G_k \cong K_n$ then the Marcello number of a graph $G$ denoted by $\varpi(G)$ is equal to $\varpi(G) = k$. By convention $\varpi(K_n) = 0$, $n \geq 1$. Certain introductory results are presented.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑