Spectral Characterization of Families of Split Graphs
- 212 Downloads
An upper bound for the sum of the squares of the entries of the principal eigenvector corresponding to a vertex subset inducing a k-regular subgraph is introduced and applied to the determination of an upper bound on the order of such induced subgraphs. Furthermore, for some connected graphs we establish a lower bound for the sum of squares of the entries of the principal eigenvector corresponding to the vertices of an independent set. Moreover, a spectral characterization of families of split graphs, involving its index and the entries of the principal eigenvector corresponding to the vertices of the maximum independent set is given. In particular, the complete split graph case is highlighted.
KeywordsSplit graph Largest eigenvalue Principal eigenvector Programming involving graphs
Mathematics Subject Classification (2000)05C50 90C35
Unable to display preview. Download preview PDF.
- 4.Cvetković D.M.: Inequalities obtained on the basis of the spectrum of the graph. Studia Sci. Math. Hung. 8, 433–436 (1973)Google Scholar
- 5.Cvetković, D.M., Doob, M., Sachs, H.: Spectra of Graphs, Theory and Applications, 3rd edn. Johan Ambrosius Barth Verlag, Heidelberg (1995)Google Scholar
- 6.Cvetković, D.M., Rowlinson, P., Simić, S.K.: An Introduction to the Theory of Graph Spectra, London Mathematical Society Student Texts. Cambridge University Press, Cambridge (2010)Google Scholar