论防御性联盟和线图
On defensive alliances and line graphs
摘要：
设$Γ$是一个简单的图，其大小为$m$，度序列为$δ_1\ge δ_2\ge ... \ge δ_n$。令${\cal L}(Γ)$表示$Γ$的线图。研究了简单图的线图的联盟数${a}({\cal L}(Γ)$和全局联盟数$γ_{a}({\cal L}(Γ))$的数学性质。我们证明了$\lceil\frac{δ_{n}+δ_{n-1}-1}{2}\rceil \le {a}({\cal L}(Γ))\le δ_1.$特别地，如果$Γ$是$δ$ -正则图（$δ>0$），则$a({\cal L}(Γ))=δ$，如果$Γ$是$(δ_1,δ_2)$ -半正则二部图，则$a({\cal L}(Γ))=\lceil \frac{δ_1+δ_2-1}{2} \rceil$ .作为研究的结果，我们比较$a({\cal L}(Γ))$和${a}(Γ)$，我们表征的图形有$a({\cal L}(Γ))<4$。证明了${\cal L}(Γ)$的全局连通联盟数受$γ_{ca}({\cal L}(Γ)) \ge \lceil\sqrt{D(Γ)+m-1}-1\rceil,$约束，其中$D(Γ)$表示$Γ$的直径，并且证明了${\cal L}(Γ)$的全局连通联盟数受$γ_{a}({\cal L}(Γ))\geq \lceil\frac{2m}{δ_{1}+δ_{2}+1}\rceil$约束.通过类比研究了强联盟的情况。
英文摘要：
Let $Γ$ be a simple graph of size $m$ and degree sequence $δ_1\ge δ_2\ge ... \ge δ_n$. Let ${\cal L}(Γ)$ denotes the line graph of $Γ$. The aim of this paper is to study mathematical properties of the alliance number, ${a}({\cal L}(Γ)$, and the global alliance number, $γ_{a}({\cal L}(Γ))$, of the line graph of a simple graph. We show that $\lceil\frac{δ_{n}+δ_{n-1}-1}{2}\rceil \le {a}({\cal L}(Γ))\le δ_1.$ In particular, if $Γ$ is a $δ$-regular graph ($δ>0$), then $a({\cal L}(Γ))=δ$, and if $Γ$ is a $(δ_1,δ_2)$-semiregular bipartite graph, then $a({\cal L}(Γ))=\lceil \frac{δ_1+δ_2-1}{2} \rceil$. As a consequence of the study we compare $a({\cal L}(Γ))$ and ${a}(Γ)$, and we characterize the graphs having $a({\cal L}(Γ))<4$. Moreover, we show that the global-connected alliance number of ${\cal L}(Γ)$ is bounded by $γ_{ca}({\cal L}(Γ)) \ge \lceil\sqrt{D(Γ)+m-1}-1\rceil,$ where $D(Γ)$ denotes the diameter of $Γ$, and we show that the global alliance number of ${\cal L}(Γ)$ is bounded by $γ_{a}({\cal L}(Γ))\geq \lceil\frac{2m}{δ_{1}+δ_{2}+1}\rceil$. The case of strong alliances is studied by analogy.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
