000			01424nam a22002297a 4500
001			PHD153
003			IN-BhIIT
005			20220501143611.0
008			220501b |||||||| |||| 00| 0 eng d
040			_aIN-BhIIT
041			_aeng
082			_a510 _bRAN/T
100			_aSonu Rani _eAuthor _917717
245			_aThe smallest positive eigenvalue of graphs / _cSonu Rani; Guided by Sasmita Barik
260			_aBhubaneswar : _bIIT Bhubaneswar, _c2021.
300			_axxiv, 130p. ; _c22 cm.
504			_aIncludes bibliographies and index.
520			_aIn spectral graph theory, we associate a matrix to the given graph and then study different properties of the graph structure via eigenvalues of this matrix. One of the extensively studied matrices in this regard is the adjacency matrix. Only few of the eigenvalues of this matrix, in particular, the largest, the second largest and the smallest have been studied widely. Let G be a graph simple graph on n vertices and A(G) be the adjacency matrix of G. In this thesis, we focus on the smallest positive eigenvalue of the adjacency matrix. We call the smallest positive eigenvalue of A(G) as the smallest positive eigenvalue of a graph G, and denote it by τ (G). This particular eigenvalue is of importance in topological theory of conjugated π-electron systems.
650			_aEigenvalues _99690
700			_aBarik, Sasmita _eGuide _93945
942			_cTH
999			_c12274 _d12274