集包含图的谱与自同构群
The spectrum and automorphism group of the set-inclusion graph
摘要：
令$n$、$k$和$l$为整数，其中$1\leq k<l\leq n-1$。集合包含图$G(n,k,l)$是其顶点集由$[n]=\{1,2,\ldots,n\}$的所有$k$ -和$l$ -子集组成的图，其中两个不同的顶点相邻，如果其中一个包含在另一个中。本文分别确定了$G(n,k,l)$的谱和自同构群。
英文摘要：
Let $n$, $k$ and $l$ be integers with $1\leq k<l\leq n-1$. The set-inclusion graph $G(n,k,l)$ is the graph whose vertex set consists of all $k$- and $l$-subsets of $[n]=\{1,2,\ldots,n\}$, where two distinct vertices are adjacent if one of them is contained in another. In this paper, we determine the spectrum and automorphism group of $G(n,k,l)$, respectively.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
