中文

Operations Research Transactions >

2019 , Vol. 23 >Issue 1: 90 - 96

DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2019.01.010

The least eignvalue of the graphs whose complements are connected and have pendant vertices

Expand
  • 1. School of Mathematics and Computation Sciences, Anqing Normal University, Anqing 246133, Anhui, China;
    2. Basic Department, Hefei Preschool Education College, Hefei 230013, China

Received date: 2017-03-09

  Online published: 2019-03-15

Fold

Abstract

The least eigenvalue of the graph is defined as the smallest eigenvalue of adjacency matrix of the graph, which is an important algebraic parameter on characterizing structural property of graphs. In this paper, we characterize the unique graph with the minimum least eigenvalue among all graphs of fixed order whose complements are connected and have pendent vertices, and present the lower bound of the least eigenvalue of such classes of graphs.

Key words： graph; complement; adjacency matrix; the least eigenvalue

Cite this article

YU Guidong, SUN Wei, LU Xingting . The least eignvalue of the graphs whose complements are connected and have pendant vertices[J]. Operations Research Transactions, 2019 , 23(1) : 90 -96 . DOI: 10.15960/j.cnki.issn.1007-6093.2019.01.010

References

[1] Bell F K, Cvetkovi? D, Rowlinson P, et al. Graph for which the least eigenvalues is minimal, I[J]. Linear Algebra and its Applications, 2008, 429:234-241.
[2] Bell F K, Cvetkovi? D, Rowlinson P, et al. Graph for which the least eigenvalues is minimal, Ⅱ[J]. Linear Algebra and its Applications, 2008, 429:2168-2176.
[3] Cardoso D M, Cvetkovi? D, Rowlinson P, et al. A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph[J]. Linear Algebra and its Applications, 2008, 429:2770-2780.
[4] Fan Y Z, Wang Y, Gao Y B. Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread[J]. Linear Algebra and its Applications, 2008, 429:577-588.
[5] Liu R F, Zhai M X, Shu J L. The least eigenvalues of unicyclic graph with n vertices and k pendant vertices[J]. Linear Algebra and its Applications, 2009, 431:657-665.
[6] Petrovi? M, Borovi?anin B, Aleksi? T. Bicyclic graphs for which the least eigenvalue is minimum[J]. Linear Algebra and its Applications, 2009, 430:1328-1335.
[7] Tan Y Y, Fan Y Z. The vertex (edge) independence number, vertex(edge) cover number and the least eigenvalue of a graph[J]. Linear Algebra and its Applications, 2010, 433:790-795.
[8] Wang Y, Fan Y Z. The least eigenvalue of a graph with cut vertices[J]. Linear Algebra and its Applications, 2010, 433:19-27.
[9] Ye M L, Fan Y Z, Liang D. The least eigenvalue of graphs with given connectivity[J]. Linear Algebra and its Applications, 2009, 430:1375-1379.
[10] Yu G D, Fan Y Z, Wang Yi. Quadratic forms on graphs with application to minimizing the least eigenvalue of signless Laplacian over bicyclic graphs[J]. Electronic Journal of Linear Algebra, 2014, 27:213-236.
[11] Fan Y Z, Zhang F F, Wang Y. The least eigenvalue of the complements of tree[J]. Linear Algebra and its Applications, 2011, 435:2150-2155.
[12] Wang Y, Fan Y Z, Li X X, et al. The least eigenvalue of graphs whose complements are unicyclic[J]. Discussiones Mathematicae Graph Theory, 2013, 35(2):1375-1379.
[13] Yu G D, Fan Y Z. The least eigenvalue of graphs[J]. 数学研究及应用, 2012, 32(6):659-665.
[14] Yu G D, Fan Y Z. The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected[J]. Operations Research Transactions, 2013, 17(2):81-88.
[15] Li S C, Wang S J. The least eigenvalue of the signless Laplacian of the complements of trees[J]. Linear Algebra and its Applications, 2012, 436:2398-2405.
[16] Yu G D, Fan Y Z, Ye M L. The least signless Laplacian eigenvalue of the complements of unicyclic graphs[J]. Applied Mathematics and Computation, 2017, 306:13-21.
[17] Haemers W. Interlacing eigenvalues and graphs[J]. Linear Algebra and its Applications, 1995, 227-228:593-616.

Options
Outlines

/

〈 〉