期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2019
卷号：16
期号：3
页码：258-264
DOI：10.1016/j.akcej.2018.11.005
语种：English
出版社：Elsevier
摘要：AbstractLetGbe a graph of ordernandA(G)=[ai,j]be its adjacency matrix such thatai,j=1ifviis adjacent tovjandai,j=0otherwise, where1≤i,j≤n. In a certain family of graphs, a graph is called minimizing (or second minimizing) if the least eigenvalue of its adjacency matrix attains the minimum (or second minimum). In this paper, we characterize the second minimizing graph among all graphs which belong to the set of complements of the trees.
关键词：KeywordsAdjacency matrixLeast eigenvalueComplement of trees
