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

1-近独立边子集的数量

The number of 1-nearly independent edge subsets

Eric O. D. Andriantiana, Zekhaya B. Shozi

AI总结:

本文研究图的1-近独立边子集计数$Z_1$,刻画了$n$顶点树中$Z_1$最小和最大的树,并提出关于第二大$Z_1$树的猜想。

摘要:

设$G=(V(G),E(G))$是一个图,其顶点集为$V(G)$,边集为$E(G)$。$E(G)$的一个子集$S$被称为$k$-近独立边子集,如果$S$中恰好有$k$对元素共享一个公共端点。$Z_k(G)$是此类子集的数量。本文研究$Z_1$。讨论了$Z_1$的各种性质。我们刻画了具有最小$Z_1$的两个$n$顶点树,以及具有最大$Z_1$的那个树。提出了关于具有第二大的$Z_1$的$n$顶点树的一个猜想。

英文摘要:

Let $G=(V(G),E(G))$ be a graph with set of vertices $V(G)$ and set of edges $E(G)$. A subset $S$ of $E(G)$ is called a $k$-nearly independent edge subsets if there are exactly $k$ pairs of elements of $S$ that share a common end. $Z_k(G)$ is the number of such subsets. This paper studies $Z_1$. Various properties of $Z_1$ are discussed. We characterise the two $n$-vertex trees with smallest $Z_1$, as well as the one with largest value. A conjecture on the $n$-vertex tree with second-largest $Z_1$ is proposed.

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

↑