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

某些图族的连通边覆盖集数量研究

On the Number of Connected Edge Cover Sets of Some Graph Families

Shahid Bahonar University of Kerman(沙希德巴孔纳尔克尔曼大学);Yazd University(亚兹德大学)

Ali Zeydi Abdian, Saeid Alikhani, Mahsa Zare

AI总结:

本文研究了某些图族的连通边覆盖集数量,推导了多项式和总数的显式公式,并通过组合证明和计算验证。

摘要:

设G=(V,E)为一个简单连通图。G的连通边覆盖是指一个子集S⊆E,使得G的每个顶点至少与S中的一个边相邻,并且由S诱导的子图是连通的。G的连通边覆盖多项式定义为E_c(G,x)=∑_i e_c(G,i)x^i,其中e_c(G,i)表示G中恰好有i条边的连通边覆盖的数量。本文为几个重要的图族推导了连通边覆盖多项式和总连通边覆盖数的显式公式,包括轮图、完全图K_n、完全二分图K_{2,n}、友谊图和棒棒糖图。每个公式都配有组合证明,并通过计算枚举法对小规模情况进行验证。

英文摘要:

Let $G=(V,E)$ be a simple connected graph. A connected edge cover of $G$ is a subset $S\subseteq E$ such that every vertex of $G$ is incident with at least one edge in $S$ and the subgraph induced by $S$ is connected. The connected edge cover polynomial of $G$ is defined as $E_c(G,x)=\sum_{i} e_c(G,i)x^i$, where $e_c(G,i)$ denotes the number of connected edge covers of $G$ with exactly $i$ edges. In this paper, we derive explicit formulas for both the connected edge cover polynomials and the total number of connected edge covers for several important graph families, including wheels, complete graphs $K_n$, complete bipartite graphs $K_{2,n}$, friendship graphs, and lollipop graphs. Each formula is accompanied by a combinatorial proof and verified by computational enumeration for small orders.

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

↑