【摘 要】
：
The connected graphs with least distance eigenvalues in [-2.383, 0] and the trees with least distance eigenvalues in (-2-√2, 0] have been known.We determine th
【机 构】
：
DepartmentofMathematics,SouthChinaNormalUniversity
论文部分内容阅读
The connected graphs with least distance eigenvalues in [-2.383, 0] and the trees with least distance eigenvalues in (-2-√2, 0] have been known.We determine the trees with least distance eigenvalues in [-3-√5,-2-√2] and the unicyclic and bicyclic graphs with least distance eigenvalues in (-2-√2,-2.383).We also determine the trees with the kth largest least distance eigenvalues for every positive integer k up to 28, and the unicyclic and bicyclic graphs with the kth largest least distance eigenvalues respectively for any positive integer k.
其他文献
日前,适逢“五一”假期连休5天,也是我国进入常态化疫情防控阶段后的首个旅游小长假.假日期间,全国多地用别出心裁地发券、优惠和各类促销,趁假期实现有效的促进消费、拉动内
令G是一个连通图.如果对任意顶点v,G-v都有完美匹配,则称G是因子临界图.Lovasz证明每一个因子临界图都有耳朵分解.在本报告中将用因子临界图的耳朵分解解决最大匹配计数问题,
A matrix is called a complex-L matrix if its complex sign pattern implies that it is of full column rank.The definition is a generalization of L-matrices from r
本刊讯 (记者 何云锋)近日,十三届全国人大常委会第十七次会议分组审议了国务院关于2019年度环境状况和环境保护目标完成情况与研究处理水污染防治法执法检查报告及审议意见
The adjacency matrix of a graph is the matrix with rows and columns indexed by its vertices such that the (i,j)-entry is equal to 1 if vertices i and j are adja
A pair of binary sequences is generalized from the concept of a two-level autocorrelation function of a single binary sequence.In this paper, we describe two cl
Let G be a simple connected graph of order n and D(G) be the distance matrix of G.Suppose that λ1(D(G)) ≥ λ2(D(G)) ≥ … ≥ λn(D(G)) are the distance spectr
In this paper we prove the strong q-log-convexity of the Eulerian polynomials of Coxeter groups using their exponential generating functions.Our proof is based
An ordered tree can be defined inductively as an unlabelled rooted tree whose principal subtrees (the subtrees obtained by removing the root) are ordered trees
在此报告中,我们将介绍一些许宝刚教授和我在"对最小度有所约束的图的划分问题"研究方向上所取得的新的研究结果,这些结果改进了一些在此领域中已有的研究成果.