arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.21791math.CO
收藏

$K_m \times P_n$中连通顶点集的平均阶

The average order of a connected vertex set in $K_m \times P_n$

Army Engineering University of PLA(中国人民解放军陆军工程大学)

Mingyuan Ma, Han Ren

AI总结:

本文推导了完全图与路径的笛卡尔积图中连通集的平均阶的闭式公式。

摘要:

设G为一个连通图。令N(G)表示G中连通集的数量,S(G)表示这些连通集的阶数之和。则A(G)=S(G)/N(G)称为G中连通集的平均阶。本文推导出$K_m \times P_n$的平均阶的闭式公式,其中$K_m \times P_n$是完全图$K_m$和路径$P_n$的笛卡尔积。

英文摘要:

Let $G$ be a connected graph. Let $N(G)$ and $S(G)$ be the number of connected sets of $G$ and the sum of the orders of these connected sets of $G$, respectively. Then $A(G)=\frac{S(G)}{N(G)}$ is called the average order of a connected set of $G$. In this paper, we derive a closed-form formula for $A(K_m \times P_n)$, where $K_m \times P_n$ is the Cartesian product of the complete graph $K_m$ and the path $P_n$.

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

↑