Let n,k and l be integers with 1≤k<l≤n-1.The set-inclusion graph G(n,k,l)is the graph whose vertex set consists of all κ-and l-subsets of[n]={1,2,...,n},where two distinct vertices are adjacent if one of them is...Let n,k and l be integers with 1≤k<l≤n-1.The set-inclusion graph G(n,k,l)is the graph whose vertex set consists of all κ-and l-subsets of[n]={1,2,...,n},where two distinct vertices are adjacent if one of them is contained in the other.In this paper,we determine the spectrum and automorphism group of G(n,k,l).展开更多
基金The first author was supported by National Natural Science Foundation of China(No.11901540)China Postdoctoral Science Foundation(No.2019M652556)+2 种基金Postdoctoral Research Sponsorship in Henan Province(No.1902011)The second author was supported by National Natural Science Foundation of China(No.11671344)The third author was supported by National Natural Science Foundation of China(No.11971274).
文摘Let n,k and l be integers with 1≤k<l≤n-1.The set-inclusion graph G(n,k,l)is the graph whose vertex set consists of all κ-and l-subsets of[n]={1,2,...,n},where two distinct vertices are adjacent if one of them is contained in the other.In this paper,we determine the spectrum and automorphism group of G(n,k,l).
